/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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-tiling/tcpy.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-30 22:41:30,024 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-30 22:41:30,025 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-30 22:41:30,095 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-30 22:41:30,095 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-30 22:41:30,097 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-30 22:41:30,100 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-30 22:41:30,102 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-30 22:41:30,103 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-30 22:41:30,106 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-30 22:41:30,107 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-30 22:41:30,108 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-30 22:41:30,108 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-30 22:41:30,109 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-30 22:41:30,110 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-30 22:41:30,111 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-30 22:41:30,112 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-30 22:41:30,112 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-30 22:41:30,115 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-30 22:41:30,117 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-30 22:41:30,118 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-30 22:41:30,120 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-30 22:41:30,120 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-30 22:41:30,121 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-30 22:41:30,122 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-30 22:41:30,122 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-30 22:41:30,122 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-30 22:41:30,123 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-30 22:41:30,123 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-30 22:41:30,123 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-30 22:41:30,124 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-30 22:41:30,124 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-30 22:41:30,124 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-30 22:41:30,125 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-30 22:41:30,125 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-30 22:41:30,126 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-30 22:41:30,126 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-30 22:41:30,126 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-30 22:41:30,126 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-30 22:41:30,127 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-30 22:41:30,127 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-30 22:41:30,131 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-01-30 22:41:30,158 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-30 22:41:30,159 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-30 22:41:30,159 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-30 22:41:30,159 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-30 22:41:30,160 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-30 22:41:30,160 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-30 22:41:30,160 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-30 22:41:30,160 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-30 22:41:30,160 INFO L138 SettingsManager]: * Use SBE=true [2022-01-30 22:41:30,160 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-30 22:41:30,161 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-30 22:41:30,161 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-30 22:41:30,161 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-30 22:41:30,161 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-30 22:41:30,161 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-30 22:41:30,161 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-30 22:41:30,161 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-30 22:41:30,162 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-30 22:41:30,162 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-30 22:41:30,162 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-30 22:41:30,162 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-30 22:41:30,162 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-30 22:41:30,162 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-30 22:41:30,162 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-30 22:41:30,162 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-30 22:41:30,162 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-30 22:41:30,162 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-30 22:41:30,162 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-30 22:41:30,163 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-30 22:41:30,163 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-30 22:41:30,163 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-30 22:41:30,163 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-30 22:41:30,163 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-30 22:41:30,163 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-30 22:41:30,308 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-30 22:41:30,322 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-30 22:41:30,323 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-30 22:41:30,324 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-30 22:41:30,324 INFO L275 PluginConnector]: CDTParser initialized [2022-01-30 22:41:30,325 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/tcpy.c [2022-01-30 22:41:30,369 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd23b39e7/1bc18e263e4f48f8b361b2218e6f22d5/FLAG240a36e22 [2022-01-30 22:41:30,732 INFO L306 CDTParser]: Found 1 translation units. [2022-01-30 22:41:30,733 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/tcpy.c [2022-01-30 22:41:30,737 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd23b39e7/1bc18e263e4f48f8b361b2218e6f22d5/FLAG240a36e22 [2022-01-30 22:41:30,745 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd23b39e7/1bc18e263e4f48f8b361b2218e6f22d5 [2022-01-30 22:41:30,747 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-30 22:41:30,747 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-01-30 22:41:30,748 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-30 22:41:30,749 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-30 22:41:30,751 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-30 22:41:30,751 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 10:41:30" (1/1) ... [2022-01-30 22:41:30,752 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37b8392a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 10:41:30, skipping insertion in model container [2022-01-30 22:41:30,752 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 10:41:30" (1/1) ... [2022-01-30 22:41:30,756 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-30 22:41:30,766 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-30 22:41:30,906 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-tiling/tcpy.c[395,408] [2022-01-30 22:41:30,928 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-30 22:41:30,936 INFO L203 MainTranslator]: Completed pre-run [2022-01-30 22:41:30,947 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-tiling/tcpy.c[395,408] [2022-01-30 22:41:30,957 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-30 22:41:30,967 INFO L208 MainTranslator]: Completed translation [2022-01-30 22:41:30,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 10:41:30 WrapperNode [2022-01-30 22:41:30,968 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-30 22:41:30,968 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-30 22:41:30,968 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-30 22:41:30,968 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-30 22:41:30,975 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 10:41:30" (1/1) ... [2022-01-30 22:41:30,976 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 10:41:30" (1/1) ... [2022-01-30 22:41:30,986 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 10:41:30" (1/1) ... [2022-01-30 22:41:30,986 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 10:41:30" (1/1) ... [2022-01-30 22:41:30,999 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 10:41:30" (1/1) ... [2022-01-30 22:41:31,002 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 10:41:30" (1/1) ... [2022-01-30 22:41:31,003 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 10:41:30" (1/1) ... [2022-01-30 22:41:31,004 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-30 22:41:31,005 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-30 22:41:31,005 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-30 22:41:31,005 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-30 22:41:31,007 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 10:41:30" (1/1) ... [2022-01-30 22:41:31,012 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-30 22:41:31,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-30 22:41:31,032 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-30 22:41:31,051 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-30 22:41:31,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-30 22:41:31,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-30 22:41:31,083 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-30 22:41:31,083 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-01-30 22:41:31,084 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-30 22:41:31,084 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-30 22:41:31,085 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-30 22:41:31,085 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-30 22:41:31,085 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-30 22:41:31,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-30 22:41:31,085 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-01-30 22:41:31,085 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-30 22:41:31,085 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-30 22:41:31,085 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-01-30 22:41:31,085 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-30 22:41:31,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-30 22:41:31,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-30 22:41:31,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-30 22:41:31,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-30 22:41:31,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-30 22:41:31,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-30 22:41:31,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-30 22:41:31,150 INFO L234 CfgBuilder]: Building ICFG [2022-01-30 22:41:31,152 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-30 22:41:31,341 INFO L275 CfgBuilder]: Performing block encoding [2022-01-30 22:41:31,345 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-30 22:41:31,345 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-01-30 22:41:31,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 10:41:31 BoogieIcfgContainer [2022-01-30 22:41:31,346 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-30 22:41:31,347 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-30 22:41:31,347 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-30 22:41:31,350 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-30 22:41:31,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 10:41:30" (1/3) ... [2022-01-30 22:41:31,350 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11181e7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 10:41:31, skipping insertion in model container [2022-01-30 22:41:31,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 10:41:30" (2/3) ... [2022-01-30 22:41:31,350 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11181e7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 10:41:31, skipping insertion in model container [2022-01-30 22:41:31,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 10:41:31" (3/3) ... [2022-01-30 22:41:31,351 INFO L111 eAbstractionObserver]: Analyzing ICFG tcpy.c [2022-01-30 22:41:31,354 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-30 22:41:31,354 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-30 22:41:31,382 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-30 22:41:31,404 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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-30 22:41:31,405 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-30 22:41:31,427 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 25 states have internal predecessors, (35), 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-30 22:41:31,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-30 22:41:31,431 INFO L506 BasicCegarLoop]: Found error trace [2022-01-30 22:41:31,431 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] [2022-01-30 22:41:31,432 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-30 22:41:31,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-30 22:41:31,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1301623166, now seen corresponding path program 1 times [2022-01-30 22:41:31,450 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-30 22:41:31,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942528903] [2022-01-30 22:41:31,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 22:41:31,451 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-30 22:41:31,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:41:31,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-30 22:41:31,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:41:31,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-30 22:41:31,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:41:31,689 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-30 22:41:31,690 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-30 22:41:31,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942528903] [2022-01-30 22:41:31,691 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942528903] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-30 22:41:31,692 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-30 22:41:31,692 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-30 22:41:31,694 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527447597] [2022-01-30 22:41:31,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-30 22:41:31,698 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-30 22:41:31,698 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-30 22:41:31,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-30 22:41:31,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-30 22:41:31,726 INFO L87 Difference]: Start difference. First operand has 34 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 25 states have internal predecessors, (35), 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 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (4), 3 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-30 22:41:31,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-30 22:41:31,857 INFO L93 Difference]: Finished difference Result 61 states and 80 transitions. [2022-01-30 22:41:31,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-30 22:41:31,872 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-01-30 22:41:31,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-30 22:41:31,876 INFO L225 Difference]: With dead ends: 61 [2022-01-30 22:41:31,876 INFO L226 Difference]: Without dead ends: 31 [2022-01-30 22:41:31,879 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-30 22:41:31,883 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 9 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-30 22:41:31,884 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 51 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-30 22:41:31,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-01-30 22:41:31,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2022-01-30 22:41:31,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-30 22:41:31,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2022-01-30 22:41:31,913 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 22 [2022-01-30 22:41:31,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-30 22:41:31,913 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2022-01-30 22:41:31,913 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (4), 3 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-30 22:41:31,913 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-01-30 22:41:31,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-30 22:41:31,914 INFO L506 BasicCegarLoop]: Found error trace [2022-01-30 22:41:31,915 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] [2022-01-30 22:41:31,915 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-30 22:41:31,915 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-30 22:41:31,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-30 22:41:31,916 INFO L85 PathProgramCache]: Analyzing trace with hash 260841182, now seen corresponding path program 1 times [2022-01-30 22:41:31,916 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-30 22:41:31,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558064590] [2022-01-30 22:41:31,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 22:41:31,916 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-30 22:41:31,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:41:32,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-30 22:41:32,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:41:32,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-30 22:41:32,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:41:32,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-30 22:41:32,095 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-30 22:41:32,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558064590] [2022-01-30 22:41:32,095 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558064590] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-30 22:41:32,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1630793612] [2022-01-30 22:41:32,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 22:41:32,095 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 22:41:32,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-30 22:41:32,097 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-30 22:41:32,098 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-30 22:41:32,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:41:32,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-30 22:41:32,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-30 22:41:32,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-30 22:41:32,263 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-30 22:41:32,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-30 22:41:32,362 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1630793612] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-30 22:41:32,362 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-30 22:41:32,362 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-01-30 22:41:32,362 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166361095] [2022-01-30 22:41:32,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-30 22:41:32,363 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-30 22:41:32,363 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-30 22:41:32,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-30 22:41:32,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-01-30 22:41:32,364 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-30 22:41:32,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-30 22:41:32,426 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2022-01-30 22:41:32,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-30 22:41:32,426 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-01-30 22:41:32,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-30 22:41:32,427 INFO L225 Difference]: With dead ends: 53 [2022-01-30 22:41:32,427 INFO L226 Difference]: Without dead ends: 33 [2022-01-30 22:41:32,429 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-01-30 22:41:32,430 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 13 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-30 22:41:32,431 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 36 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-30 22:41:32,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-01-30 22:41:32,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2022-01-30 22:41:32,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-30 22:41:32,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2022-01-30 22:41:32,443 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 24 [2022-01-30 22:41:32,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-30 22:41:32,443 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2022-01-30 22:41:32,443 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-30 22:41:32,443 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2022-01-30 22:41:32,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-30 22:41:32,444 INFO L506 BasicCegarLoop]: Found error trace [2022-01-30 22:41:32,444 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] [2022-01-30 22:41:32,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-01-30 22:41:32,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 22:41:32,652 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-30 22:41:32,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-30 22:41:32,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1383540540, now seen corresponding path program 2 times [2022-01-30 22:41:32,652 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-30 22:41:32,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036172825] [2022-01-30 22:41:32,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 22:41:32,653 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-30 22:41:32,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:41:32,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-30 22:41:32,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:41:32,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-30 22:41:32,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:41:32,785 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-30 22:41:32,785 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-30 22:41:32,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036172825] [2022-01-30 22:41:32,785 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036172825] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-30 22:41:32,785 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-30 22:41:32,786 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-30 22:41:32,786 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114158159] [2022-01-30 22:41:32,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-30 22:41:32,786 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-30 22:41:32,786 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-30 22:41:32,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-30 22:41:32,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-30 22:41:32,787 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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-30 22:41:32,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-30 22:41:32,903 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2022-01-30 22:41:32,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-30 22:41:32,903 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2022-01-30 22:41:32,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-30 22:41:32,906 INFO L225 Difference]: With dead ends: 49 [2022-01-30 22:41:32,906 INFO L226 Difference]: Without dead ends: 38 [2022-01-30 22:41:32,908 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-30 22:41:32,910 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 52 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-30 22:41:32,912 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 29 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-30 22:41:32,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-01-30 22:41:32,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 33. [2022-01-30 22:41:32,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-30 22:41:32,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2022-01-30 22:41:32,929 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 26 [2022-01-30 22:41:32,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-30 22:41:32,929 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2022-01-30 22:41:32,929 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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-30 22:41:32,930 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-01-30 22:41:32,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-30 22:41:32,930 INFO L506 BasicCegarLoop]: Found error trace [2022-01-30 22:41:32,931 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] [2022-01-30 22:41:32,931 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-30 22:41:32,931 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-30 22:41:32,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-30 22:41:32,931 INFO L85 PathProgramCache]: Analyzing trace with hash -2006672966, now seen corresponding path program 1 times [2022-01-30 22:41:32,931 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-30 22:41:32,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550959511] [2022-01-30 22:41:32,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 22:41:32,933 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-30 22:41:32,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:41:33,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-30 22:41:33,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:41:33,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-30 22:41:33,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:41:33,176 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-30 22:41:33,177 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-30 22:41:33,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550959511] [2022-01-30 22:41:33,177 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550959511] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-30 22:41:33,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284884129] [2022-01-30 22:41:33,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 22:41:33,177 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 22:41:33,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-30 22:41:33,191 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-30 22:41:33,192 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-30 22:41:33,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:41:33,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 25 conjunts are in the unsatisfiable core [2022-01-30 22:41:33,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-30 22:41:33,294 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-30 22:41:33,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:41:33,376 INFO L353 Elim1Store]: treesize reduction 26, result has 40.9 percent of original size [2022-01-30 22:41:33,376 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 33 [2022-01-30 22:41:33,428 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2022-01-30 22:41:33,447 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-30 22:41:33,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-30 22:41:33,505 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-30 22:41:33,505 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 474 treesize of output 450 [2022-01-30 22:41:33,524 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 220 treesize of output 184 [2022-01-30 22:41:40,270 INFO L353 Elim1Store]: treesize reduction 7, result has 41.7 percent of original size [2022-01-30 22:41:40,271 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-01-30 22:41:40,312 INFO L353 Elim1Store]: treesize reduction 7, result has 41.7 percent of original size [2022-01-30 22:41:40,312 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 61 [2022-01-30 22:41:40,364 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-30 22:41:40,365 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 376 treesize of output 368 [2022-01-30 22:41:40,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:41:40,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:41:40,826 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2022-01-30 22:41:40,907 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-30 22:41:40,908 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284884129] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-30 22:41:40,908 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-30 22:41:40,908 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 16 [2022-01-30 22:41:40,908 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762554691] [2022-01-30 22:41:40,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-30 22:41:40,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-30 22:41:40,909 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-30 22:41:40,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-30 22:41:40,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-01-30 22:41:40,910 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 16 states, 15 states have (on average 2.4) internal successors, (36), 13 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-30 22:41:41,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-30 22:41:41,057 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-01-30 22:41:41,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-30 22:41:41,060 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.4) internal successors, (36), 13 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 28 [2022-01-30 22:41:41,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-30 22:41:41,061 INFO L225 Difference]: With dead ends: 44 [2022-01-30 22:41:41,061 INFO L226 Difference]: Without dead ends: 42 [2022-01-30 22:41:41,061 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2022-01-30 22:41:41,062 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 47 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-30 22:41:41,062 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 98 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-30 22:41:41,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-01-30 22:41:41,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2022-01-30 22:41:41,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 29 states have (on average 1.103448275862069) internal successors, (32), 30 states have internal predecessors, (32), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-30 22:41:41,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2022-01-30 22:41:41,066 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 28 [2022-01-30 22:41:41,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-30 22:41:41,066 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2022-01-30 22:41:41,067 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.4) internal successors, (36), 13 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-30 22:41:41,067 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2022-01-30 22:41:41,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-30 22:41:41,067 INFO L506 BasicCegarLoop]: Found error trace [2022-01-30 22:41:41,067 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-30 22:41:41,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-01-30 22:41:41,268 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-30 22:41:41,268 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-30 22:41:41,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-30 22:41:41,269 INFO L85 PathProgramCache]: Analyzing trace with hash 223702509, now seen corresponding path program 1 times [2022-01-30 22:41:41,269 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-30 22:41:41,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804454165] [2022-01-30 22:41:41,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 22:41:41,269 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-30 22:41:41,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:41:41,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-30 22:41:41,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:41:41,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-30 22:41:41,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:41:41,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-01-30 22:41:41,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:41:41,620 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-30 22:41:41,620 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-30 22:41:41,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804454165] [2022-01-30 22:41:41,620 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804454165] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-30 22:41:41,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536269873] [2022-01-30 22:41:41,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 22:41:41,620 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 22:41:41,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-30 22:41:41,623 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-30 22:41:41,674 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-30 22:41:41,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:41:41,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 36 conjunts are in the unsatisfiable core [2022-01-30 22:41:41,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-30 22:41:41,710 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-30 22:41:41,761 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-30 22:41:41,876 INFO L353 Elim1Store]: treesize reduction 32, result has 27.3 percent of original size [2022-01-30 22:41:41,877 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 32 [2022-01-30 22:41:42,674 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~acopy~0.offset_BEFORE_CALL_3 Int) (v_main_~acopy~0.base_BEFORE_CALL_4 Int) (~SIZE~0 Int) (v_main_~a~0.base_BEFORE_CALL_4 Int)) (and (<= ~SIZE~0 2) (not (= v_main_~a~0.base_BEFORE_CALL_4 v_main_~acopy~0.base_BEFORE_CALL_4)) (let ((.cse0 (* ~SIZE~0 4))) (= (select (select |c_#memory_int| v_main_~acopy~0.base_BEFORE_CALL_4) (+ .cse0 v_main_~acopy~0.offset_BEFORE_CALL_3 (- 4))) (select (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_4) (+ .cse0 (- 4))))) (< 1 ~SIZE~0))) is different from true [2022-01-30 22:41:43,589 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-30 22:41:43,592 INFO L353 Elim1Store]: treesize reduction 12, result has 20.0 percent of original size [2022-01-30 22:41:43,592 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 13 [2022-01-30 22:41:43,610 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-01-30 22:41:43,610 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-30 22:41:45,329 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~acopy~0.offset Int) (v_ArrVal_97 Int)) (let ((.cse0 (store (let ((.cse1 (* c_main_~i~0 (- 4))) (.cse2 (* 4 c_~SIZE~0))) (store (select |c_#memory_int| c_main_~acopy~0.base) (+ .cse1 (- 4) .cse2 main_~acopy~0.offset) (select (select |c_#memory_int| c_main_~a~0.base) (+ .cse1 c_main_~a~0.offset (- 4) .cse2)))) (+ (* c_main_~i~0 4) main_~acopy~0.offset) v_ArrVal_97))) (= (select (select (store |c_#memory_int| c_main_~acopy~0.base .cse0) c_main_~a~0.base) (+ c_main_~a~0.offset 4)) (select .cse0 (+ main_~acopy~0.offset 4))))) is different from false [2022-01-30 22:41:45,889 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~acopy~0.offset Int) (v_ArrVal_97 Int)) (let ((.cse0 (store (let ((.cse1 (* 4 c_~SIZE~0))) (store (select |c_#memory_int| c_main_~acopy~0.base) (+ (- 4) .cse1 main_~acopy~0.offset) (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (- 4) .cse1)))) main_~acopy~0.offset v_ArrVal_97))) (= (select .cse0 (+ main_~acopy~0.offset 4)) (select (select (store |c_#memory_int| c_main_~acopy~0.base .cse0) c_main_~a~0.base) (+ c_main_~a~0.offset 4))))) is different from false [2022-01-30 22:41:45,896 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1536269873] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-30 22:41:45,896 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-30 22:41:45,896 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 26 [2022-01-30 22:41:45,896 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623959084] [2022-01-30 22:41:45,896 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-30 22:41:45,896 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-30 22:41:45,897 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-30 22:41:45,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-30 22:41:45,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=637, Unknown=3, NotChecked=162, Total=930 [2022-01-30 22:41:45,897 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand has 26 states, 25 states have (on average 2.12) internal successors, (53), 23 states have internal predecessors, (53), 6 states have call successors, (9), 6 states have call predecessors, (9), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-01-30 22:41:53,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-30 22:41:53,789 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2022-01-30 22:41:53,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-30 22:41:53,790 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.12) internal successors, (53), 23 states have internal predecessors, (53), 6 states have call successors, (9), 6 states have call predecessors, (9), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 36 [2022-01-30 22:41:53,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-30 22:41:53,791 INFO L225 Difference]: With dead ends: 94 [2022-01-30 22:41:53,791 INFO L226 Difference]: Without dead ends: 75 [2022-01-30 22:41:53,792 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=238, Invalid=1323, Unknown=11, NotChecked=234, Total=1806 [2022-01-30 22:41:53,793 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 69 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 116 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-30 22:41:53,793 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 134 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 382 Invalid, 0 Unknown, 116 Unchecked, 0.2s Time] [2022-01-30 22:41:53,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-01-30 22:41:53,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 60. [2022-01-30 22:41:53,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 47 states have internal predecessors, (50), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-30 22:41:53,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2022-01-30 22:41:53,805 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 36 [2022-01-30 22:41:53,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-30 22:41:53,806 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2022-01-30 22:41:53,806 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.12) internal successors, (53), 23 states have internal predecessors, (53), 6 states have call successors, (9), 6 states have call predecessors, (9), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-01-30 22:41:53,806 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2022-01-30 22:41:53,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-30 22:41:53,808 INFO L506 BasicCegarLoop]: Found error trace [2022-01-30 22:41:53,808 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-30 22:41:53,827 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-30 22:41:54,009 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-30 22:41:54,009 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-30 22:41:54,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-30 22:41:54,010 INFO L85 PathProgramCache]: Analyzing trace with hash -200222389, now seen corresponding path program 2 times [2022-01-30 22:41:54,010 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-30 22:41:54,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991671672] [2022-01-30 22:41:54,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 22:41:54,010 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-30 22:41:54,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:41:54,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-30 22:41:54,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:41:54,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-30 22:41:54,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:41:54,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-01-30 22:41:54,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:41:54,188 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-30 22:41:54,189 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-30 22:41:54,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991671672] [2022-01-30 22:41:54,189 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991671672] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-30 22:41:54,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [867315885] [2022-01-30 22:41:54,189 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-30 22:41:54,189 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 22:41:54,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-30 22:41:54,195 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-30 22:41:54,196 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-30 22:41:54,263 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-30 22:41:54,263 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-30 22:41:54,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-30 22:41:54,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-30 22:41:54,422 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-30 22:41:54,423 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-30 22:41:54,707 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-30 22:41:54,707 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [867315885] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-30 22:41:54,707 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-30 22:41:54,708 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 23 [2022-01-30 22:41:54,708 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251057095] [2022-01-30 22:41:54,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-30 22:41:54,708 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-30 22:41:54,708 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-30 22:41:54,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-30 22:41:54,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=386, Unknown=0, NotChecked=0, Total=506 [2022-01-30 22:41:54,709 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand has 23 states, 23 states have (on average 2.652173913043478) internal successors, (61), 22 states have internal predecessors, (61), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-01-30 22:41:55,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-30 22:41:55,099 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2022-01-30 22:41:55,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-30 22:41:55,099 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.652173913043478) internal successors, (61), 22 states have internal predecessors, (61), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 38 [2022-01-30 22:41:55,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-30 22:41:55,100 INFO L225 Difference]: With dead ends: 105 [2022-01-30 22:41:55,100 INFO L226 Difference]: Without dead ends: 88 [2022-01-30 22:41:55,102 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=212, Invalid=658, Unknown=0, NotChecked=0, Total=870 [2022-01-30 22:41:55,103 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 170 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-30 22:41:55,103 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [173 Valid, 107 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-30 22:41:55,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-01-30 22:41:55,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 62. [2022-01-30 22:41:55,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 49 states have internal predecessors, (52), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-30 22:41:55,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2022-01-30 22:41:55,110 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 38 [2022-01-30 22:41:55,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-30 22:41:55,110 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2022-01-30 22:41:55,111 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.652173913043478) internal successors, (61), 22 states have internal predecessors, (61), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-01-30 22:41:55,111 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2022-01-30 22:41:55,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-30 22:41:55,111 INFO L506 BasicCegarLoop]: Found error trace [2022-01-30 22:41:55,111 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, 1] [2022-01-30 22:41:55,145 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-30 22:41:55,328 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-30 22:41:55,329 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-30 22:41:55,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-30 22:41:55,329 INFO L85 PathProgramCache]: Analyzing trace with hash -994416951, now seen corresponding path program 3 times [2022-01-30 22:41:55,329 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-30 22:41:55,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790605009] [2022-01-30 22:41:55,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 22:41:55,329 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-30 22:41:55,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:41:55,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-30 22:41:55,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:41:55,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-30 22:41:55,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:41:55,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-01-30 22:41:55,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:41:55,550 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-30 22:41:55,550 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-30 22:41:55,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790605009] [2022-01-30 22:41:55,550 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790605009] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-30 22:41:55,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800677281] [2022-01-30 22:41:55,551 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-30 22:41:55,551 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 22:41:55,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-30 22:41:55,563 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-30 22:41:55,564 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-30 22:41:55,619 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-30 22:41:55,619 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-30 22:41:55,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 27 conjunts are in the unsatisfiable core [2022-01-30 22:41:55,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-30 22:41:55,636 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-30 22:41:55,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:41:55,750 INFO L353 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-01-30 22:41:55,750 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 37 [2022-01-30 22:41:56,298 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~acopy~0.base_BEFORE_CALL_7 Int) (v_main_~a~0.base_BEFORE_CALL_7 Int)) (and (not (= v_main_~a~0.base_BEFORE_CALL_7 v_main_~acopy~0.base_BEFORE_CALL_7)) (= (select (select |c_#memory_int| v_main_~acopy~0.base_BEFORE_CALL_7) 4) (select (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_7) 4)))) is different from true [2022-01-30 22:41:56,374 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2022-01-30 22:41:56,419 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 2 not checked. [2022-01-30 22:41:56,420 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-30 22:41:56,499 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-30 22:41:56,499 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 946 treesize of output 890 [2022-01-30 22:41:56,508 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 882 treesize of output 810 [2022-01-30 22:42:00,174 INFO L353 Elim1Store]: treesize reduction 9, result has 35.7 percent of original size [2022-01-30 22:42:00,179 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 61 [2022-01-30 22:42:00,271 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-30 22:42:00,272 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 353 treesize of output 337 [2022-01-30 22:42:00,802 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-30 22:42:00,802 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1800677281] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-30 22:42:00,802 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-30 22:42:00,802 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 27 [2022-01-30 22:42:00,802 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231265527] [2022-01-30 22:42:00,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-30 22:42:00,803 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-30 22:42:00,803 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-30 22:42:00,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-30 22:42:00,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=569, Unknown=1, NotChecked=48, Total=702 [2022-01-30 22:42:00,804 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand has 27 states, 26 states have (on average 2.6538461538461537) internal successors, (69), 25 states have internal predecessors, (69), 8 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-01-30 22:42:06,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-30 22:42:06,715 INFO L93 Difference]: Finished difference Result 126 states and 136 transitions. [2022-01-30 22:42:06,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-01-30 22:42:06,716 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.6538461538461537) internal successors, (69), 25 states have internal predecessors, (69), 8 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 40 [2022-01-30 22:42:06,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-30 22:42:06,717 INFO L225 Difference]: With dead ends: 126 [2022-01-30 22:42:06,717 INFO L226 Difference]: Without dead ends: 97 [2022-01-30 22:42:06,718 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 559 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=430, Invalid=2323, Unknown=7, NotChecked=102, Total=2862 [2022-01-30 22:42:06,718 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 149 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 110 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-30 22:42:06,719 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 147 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 596 Invalid, 0 Unknown, 110 Unchecked, 0.3s Time] [2022-01-30 22:42:06,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-01-30 22:42:06,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 63. [2022-01-30 22:42:06,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 50 states have internal predecessors, (53), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-30 22:42:06,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2022-01-30 22:42:06,730 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 40 [2022-01-30 22:42:06,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-30 22:42:06,730 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2022-01-30 22:42:06,730 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.6538461538461537) internal successors, (69), 25 states have internal predecessors, (69), 8 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-01-30 22:42:06,730 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2022-01-30 22:42:06,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-30 22:42:06,732 INFO L506 BasicCegarLoop]: Found error trace [2022-01-30 22:42:06,732 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2022-01-30 22:42:06,750 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-30 22:42:06,948 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-30 22:42:06,948 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-30 22:42:06,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-30 22:42:06,949 INFO L85 PathProgramCache]: Analyzing trace with hash -673947872, now seen corresponding path program 4 times [2022-01-30 22:42:06,949 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-30 22:42:06,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101277810] [2022-01-30 22:42:06,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 22:42:06,949 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-30 22:42:06,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:42:07,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-30 22:42:07,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:42:07,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-30 22:42:07,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:42:07,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-01-30 22:42:07,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:42:07,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-01-30 22:42:07,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:42:07,042 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-30 22:42:07,043 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-30 22:42:07,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101277810] [2022-01-30 22:42:07,043 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101277810] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-30 22:42:07,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108405258] [2022-01-30 22:42:07,043 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-30 22:42:07,043 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 22:42:07,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-30 22:42:07,044 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-30 22:42:07,070 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-30 22:42:07,113 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-30 22:42:07,113 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-30 22:42:07,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-30 22:42:07,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-30 22:42:07,241 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-30 22:42:07,241 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-30 22:42:07,316 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-30 22:42:07,316 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108405258] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-30 22:42:07,316 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-30 22:42:07,316 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 15 [2022-01-30 22:42:07,316 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191279281] [2022-01-30 22:42:07,316 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-30 22:42:07,317 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-30 22:42:07,317 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-30 22:42:07,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-30 22:42:07,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-01-30 22:42:07,317 INFO L87 Difference]: Start difference. First operand 63 states and 66 transitions. Second operand has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 8 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-01-30 22:42:07,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-30 22:42:07,474 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2022-01-30 22:42:07,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-30 22:42:07,474 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 8 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 44 [2022-01-30 22:42:07,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-30 22:42:07,475 INFO L225 Difference]: With dead ends: 101 [2022-01-30 22:42:07,475 INFO L226 Difference]: Without dead ends: 63 [2022-01-30 22:42:07,475 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 90 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-30 22:42:07,476 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 70 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-30 22:42:07,476 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 56 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-30 22:42:07,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-01-30 22:42:07,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 53. [2022-01-30 22:42:07,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 42 states have internal predecessors, (44), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-01-30 22:42:07,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2022-01-30 22:42:07,481 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 44 [2022-01-30 22:42:07,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-30 22:42:07,481 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2022-01-30 22:42:07,482 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 8 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-01-30 22:42:07,482 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2022-01-30 22:42:07,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-01-30 22:42:07,482 INFO L506 BasicCegarLoop]: Found error trace [2022-01-30 22:42:07,482 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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] [2022-01-30 22:42:07,499 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-30 22:42:07,682 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-30 22:42:07,683 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-30 22:42:07,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-30 22:42:07,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1616901542, now seen corresponding path program 5 times [2022-01-30 22:42:07,683 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-30 22:42:07,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966137205] [2022-01-30 22:42:07,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 22:42:07,684 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-30 22:42:07,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:42:08,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-30 22:42:08,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:42:08,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-30 22:42:08,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:42:08,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-01-30 22:42:08,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:42:08,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-01-30 22:42:08,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:42:08,762 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-30 22:42:08,762 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-30 22:42:08,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966137205] [2022-01-30 22:42:08,762 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966137205] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-30 22:42:08,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236429389] [2022-01-30 22:42:08,762 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-30 22:42:08,762 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 22:42:08,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-30 22:42:08,763 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-30 22:42:08,764 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-30 22:42:08,855 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-01-30 22:42:08,856 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-30 22:42:08,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 43 conjunts are in the unsatisfiable core [2022-01-30 22:42:08,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-30 22:42:08,870 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-30 22:42:09,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:42:09,201 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 40 [2022-01-30 22:42:10,047 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~a~0.base_BEFORE_CALL_11 Int) (v_main_~acopy~0.base_BEFORE_CALL_11 Int) (aux_mod_~SIZE~0_15 Int) (aux_div_~SIZE~0_15 Int)) (and (not (= v_main_~acopy~0.base_BEFORE_CALL_11 v_main_~a~0.base_BEFORE_CALL_11)) (<= 0 aux_mod_~SIZE~0_15) (< 1 aux_div_~SIZE~0_15) (<= (+ (* 2 aux_div_~SIZE~0_15) aux_mod_~SIZE~0_15) 4) (let ((.cse0 (+ (* 8 aux_div_~SIZE~0_15) (* aux_mod_~SIZE~0_15 4) (- 8)))) (= (select (select |c_#memory_int| v_main_~acopy~0.base_BEFORE_CALL_11) .cse0) (select (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_11) .cse0))))) is different from true [2022-01-30 22:42:10,999 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~acopy~0.base_BEFORE_CALL_12 Int) (v_main_~a~0.base_BEFORE_CALL_12 Int) (aux_mod_~SIZE~0_15 Int) (aux_div_~SIZE~0_15 Int)) (and (<= 0 aux_mod_~SIZE~0_15) (< 1 aux_div_~SIZE~0_15) (<= (+ (* 2 aux_div_~SIZE~0_15) aux_mod_~SIZE~0_15) 4) (not (= v_main_~acopy~0.base_BEFORE_CALL_12 v_main_~a~0.base_BEFORE_CALL_12)) (let ((.cse0 (+ (* 8 aux_div_~SIZE~0_15) (* aux_mod_~SIZE~0_15 4) (- 8)))) (= (select (select |c_#memory_int| v_main_~acopy~0.base_BEFORE_CALL_12) .cse0) (select (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_12) .cse0))))) is different from true [2022-01-30 22:42:11,311 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-30 22:42:11,314 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 10 [2022-01-30 22:42:11,367 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-01-30 22:42:11,367 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-30 22:42:11,549 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-30 22:42:11,549 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 590 treesize of output 558 [2022-01-30 22:42:14,270 INFO L353 Elim1Store]: treesize reduction 9, result has 50.0 percent of original size [2022-01-30 22:42:14,270 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 95 [2022-01-30 22:42:14,273 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-30 22:42:14,276 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 100 treesize of output 92 [2022-01-30 22:42:14,320 INFO L353 Elim1Store]: treesize reduction 14, result has 71.4 percent of original size [2022-01-30 22:42:14,321 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 390 treesize of output 346 [2022-01-30 22:42:15,342 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-30 22:42:15,342 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236429389] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-30 22:42:15,343 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-30 22:42:15,343 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 17] total 50 [2022-01-30 22:42:15,343 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335696643] [2022-01-30 22:42:15,343 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-30 22:42:15,343 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-01-30 22:42:15,343 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-30 22:42:15,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-01-30 22:42:15,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=2008, Unknown=2, NotChecked=186, Total=2450 [2022-01-30 22:42:15,344 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand has 50 states, 49 states have (on average 2.020408163265306) internal successors, (99), 47 states have internal predecessors, (99), 11 states have call successors, (14), 7 states have call predecessors, (14), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-01-30 22:42:16,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-30 22:42:16,616 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2022-01-30 22:42:16,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-01-30 22:42:16,617 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 2.020408163265306) internal successors, (99), 47 states have internal predecessors, (99), 11 states have call successors, (14), 7 states have call predecessors, (14), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 50 [2022-01-30 22:42:16,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-30 22:42:16,617 INFO L225 Difference]: With dead ends: 119 [2022-01-30 22:42:16,618 INFO L226 Difference]: Without dead ends: 92 [2022-01-30 22:42:16,619 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 77 SyntacticMatches, 7 SemanticMatches, 68 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1072 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=582, Invalid=3980, Unknown=2, NotChecked=266, Total=4830 [2022-01-30 22:42:16,619 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 85 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 214 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-30 22:42:16,619 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 274 Invalid, 950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 657 Invalid, 0 Unknown, 214 Unchecked, 0.3s Time] [2022-01-30 22:42:16,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-01-30 22:42:16,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 76. [2022-01-30 22:42:16,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 60 states have (on average 1.0666666666666667) internal successors, (64), 61 states have internal predecessors, (64), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-01-30 22:42:16,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2022-01-30 22:42:16,637 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 50 [2022-01-30 22:42:16,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-30 22:42:16,638 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2022-01-30 22:42:16,638 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 2.020408163265306) internal successors, (99), 47 states have internal predecessors, (99), 11 states have call successors, (14), 7 states have call predecessors, (14), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-01-30 22:42:16,638 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2022-01-30 22:42:16,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-30 22:42:16,639 INFO L506 BasicCegarLoop]: Found error trace [2022-01-30 22:42:16,639 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 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] [2022-01-30 22:42:16,659 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-30 22:42:16,857 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-30 22:42:16,857 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-30 22:42:16,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-30 22:42:16,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1461008696, now seen corresponding path program 6 times [2022-01-30 22:42:16,857 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-30 22:42:16,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660827747] [2022-01-30 22:42:16,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 22:42:16,858 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-30 22:42:16,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:42:17,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-30 22:42:17,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:42:17,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-30 22:42:17,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:42:17,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-01-30 22:42:17,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:42:17,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-01-30 22:42:17,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:42:17,068 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 13 proven. 20 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-30 22:42:17,069 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-30 22:42:17,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660827747] [2022-01-30 22:42:17,069 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660827747] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-30 22:42:17,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036553517] [2022-01-30 22:42:17,069 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-30 22:42:17,069 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 22:42:17,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-30 22:42:17,083 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-30 22:42:17,128 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-30 22:42:17,161 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-01-30 22:42:17,162 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-30 22:42:17,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 39 conjunts are in the unsatisfiable core [2022-01-30 22:42:17,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-30 22:42:17,178 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-30 22:42:17,400 INFO L353 Elim1Store]: treesize reduction 49, result has 23.4 percent of original size [2022-01-30 22:42:17,400 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 42 [2022-01-30 22:42:19,826 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~a~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_91 Int) (aux_mod_aux_mod_~SIZE~0_15_26 Int) (aux_div_aux_mod_~SIZE~0_15_26 Int) (v_main_~acopy~0.base_BEFORE_CALL_17 Int) (v_main_~a~0.base_BEFORE_CALL_17 Int) (v_main_~acopy~0.offset_BEFORE_CALL_15 Int) (aux_div_~SIZE~0_15 Int)) (let ((.cse4 (* 2 aux_div_aux_mod_~SIZE~0_15_26))) (and (<= 0 aux_mod_aux_mod_~SIZE~0_15_26) (<= v_main_~i~0_91 1) (<= aux_mod_aux_mod_~SIZE~0_15_26 0) (not (= v_main_~acopy~0.base_BEFORE_CALL_17 v_main_~a~0.base_BEFORE_CALL_17)) (<= aux_div_~SIZE~0_15 (+ v_main_~i~0_91 1)) (let ((.cse0 (* 8 aux_div_~SIZE~0_15)) (.cse1 (* aux_mod_aux_mod_~SIZE~0_15_26 4)) (.cse2 (* 8 aux_div_aux_mod_~SIZE~0_15_26)) (.cse3 (* v_main_~i~0_91 (- 4)))) (= (select (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_17) (+ .cse0 v_main_~a~0.offset_BEFORE_CALL_16 .cse1 (- 4) .cse2 .cse3)) (select (select |c_#memory_int| v_main_~acopy~0.base_BEFORE_CALL_17) (+ .cse0 .cse1 (- 4) .cse2 .cse3 v_main_~acopy~0.offset_BEFORE_CALL_15)))) (< 3 (+ aux_mod_aux_mod_~SIZE~0_15_26 .cse4 (* 2 aux_div_~SIZE~0_15))) (< (+ aux_mod_aux_mod_~SIZE~0_15_26 .cse4) 2)))) is different from true [2022-01-30 22:42:22,397 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~a~0.offset_BEFORE_CALL_17 Int) (v_main_~i~0_91 Int) (aux_mod_aux_mod_~SIZE~0_15_26 Int) (aux_div_aux_mod_~SIZE~0_15_26 Int) (v_main_~acopy~0.base_BEFORE_CALL_18 Int) (v_main_~acopy~0.offset_BEFORE_CALL_16 Int) (v_main_~a~0.base_BEFORE_CALL_18 Int) (aux_div_~SIZE~0_15 Int)) (let ((.cse0 (* 2 aux_div_aux_mod_~SIZE~0_15_26))) (and (<= 0 aux_mod_aux_mod_~SIZE~0_15_26) (<= v_main_~i~0_91 1) (not (= v_main_~acopy~0.base_BEFORE_CALL_18 v_main_~a~0.base_BEFORE_CALL_18)) (<= aux_mod_aux_mod_~SIZE~0_15_26 0) (<= aux_div_~SIZE~0_15 (+ v_main_~i~0_91 1)) (< 3 (+ aux_mod_aux_mod_~SIZE~0_15_26 .cse0 (* 2 aux_div_~SIZE~0_15))) (< (+ aux_mod_aux_mod_~SIZE~0_15_26 .cse0) 2) (let ((.cse1 (* 8 aux_div_~SIZE~0_15)) (.cse2 (* aux_mod_aux_mod_~SIZE~0_15_26 4)) (.cse3 (* 8 aux_div_aux_mod_~SIZE~0_15_26)) (.cse4 (* v_main_~i~0_91 (- 4)))) (= (select (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_18) (+ .cse1 v_main_~a~0.offset_BEFORE_CALL_17 .cse2 (- 4) .cse3 .cse4)) (select (select |c_#memory_int| v_main_~acopy~0.base_BEFORE_CALL_18) (+ .cse1 .cse2 (- 4) .cse3 .cse4 v_main_~acopy~0.offset_BEFORE_CALL_16))))))) is different from true [2022-01-30 22:42:23,256 INFO L353 Elim1Store]: treesize reduction 42, result has 14.3 percent of original size [2022-01-30 22:42:23,256 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 16 [2022-01-30 22:42:23,333 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 2 trivial. 8 not checked. [2022-01-30 22:42:23,333 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-30 22:42:23,596 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-30 22:42:23,596 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 272 treesize of output 260 [2022-01-30 22:42:23,881 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-30 22:42:23,882 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 98 [2022-01-30 22:42:23,885 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 421 treesize of output 405 [2022-01-30 22:42:24,028 INFO L353 Elim1Store]: treesize reduction 14, result has 71.4 percent of original size [2022-01-30 22:42:24,028 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1014 treesize of output 864 [2022-01-30 22:42:25,838 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 27 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-30 22:42:25,839 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036553517] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-30 22:42:25,839 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-30 22:42:25,839 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 22, 19] total 47 [2022-01-30 22:42:25,839 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766735787] [2022-01-30 22:42:25,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-30 22:42:25,839 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-01-30 22:42:25,839 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-30 22:42:25,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-01-30 22:42:25,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=1725, Unknown=2, NotChecked=174, Total=2162 [2022-01-30 22:42:25,840 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand has 47 states, 46 states have (on average 2.152173913043478) internal successors, (99), 45 states have internal predecessors, (99), 10 states have call successors, (13), 7 states have call predecessors, (13), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-01-30 22:42:35,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-30 22:42:35,192 INFO L93 Difference]: Finished difference Result 118 states and 122 transitions. [2022-01-30 22:42:35,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-01-30 22:42:35,193 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 2.152173913043478) internal successors, (99), 45 states have internal predecessors, (99), 10 states have call successors, (13), 7 states have call predecessors, (13), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 52 [2022-01-30 22:42:35,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-30 22:42:35,194 INFO L225 Difference]: With dead ends: 118 [2022-01-30 22:42:35,194 INFO L226 Difference]: Without dead ends: 93 [2022-01-30 22:42:35,195 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 78 SyntacticMatches, 3 SemanticMatches, 65 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1167 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=582, Invalid=3579, Unknown=7, NotChecked=254, Total=4422 [2022-01-30 22:42:35,195 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 46 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 1111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 277 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-30 22:42:35,195 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 283 Invalid, 1111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 798 Invalid, 0 Unknown, 277 Unchecked, 0.4s Time] [2022-01-30 22:42:35,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-01-30 22:42:35,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 78. [2022-01-30 22:42:35,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 62 states have (on average 1.064516129032258) internal successors, (66), 63 states have internal predecessors, (66), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-01-30 22:42:35,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2022-01-30 22:42:35,206 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 52 [2022-01-30 22:42:35,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-30 22:42:35,207 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2022-01-30 22:42:35,207 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 2.152173913043478) internal successors, (99), 45 states have internal predecessors, (99), 10 states have call successors, (13), 7 states have call predecessors, (13), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-01-30 22:42:35,207 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-01-30 22:42:35,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-01-30 22:42:35,207 INFO L506 BasicCegarLoop]: Found error trace [2022-01-30 22:42:35,207 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 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] [2022-01-30 22:42:35,227 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-30 22:42:35,423 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-30 22:42:35,423 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-30 22:42:35,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-30 22:42:35,424 INFO L85 PathProgramCache]: Analyzing trace with hash 408429110, now seen corresponding path program 7 times [2022-01-30 22:42:35,424 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-30 22:42:35,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944785208] [2022-01-30 22:42:35,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 22:42:35,424 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-30 22:42:35,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:42:35,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-30 22:42:35,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:42:35,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-30 22:42:35,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:42:35,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-30 22:42:35,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:42:35,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-01-30 22:42:35,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:42:35,713 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-30 22:42:35,714 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-30 22:42:35,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944785208] [2022-01-30 22:42:35,714 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944785208] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-30 22:42:35,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274408507] [2022-01-30 22:42:35,714 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-30 22:42:35,714 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 22:42:35,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-30 22:42:35,715 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-30 22:42:35,751 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-30 22:42:35,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:42:35,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-30 22:42:35,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-30 22:42:36,034 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 9 proven. 25 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-30 22:42:36,034 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-30 22:42:36,333 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 13 proven. 25 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-30 22:42:36,333 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [274408507] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-30 22:42:36,333 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-30 22:42:36,333 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 34 [2022-01-30 22:42:36,333 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718968162] [2022-01-30 22:42:36,333 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-30 22:42:36,334 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-01-30 22:42:36,334 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-30 22:42:36,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-01-30 22:42:36,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=890, Unknown=0, NotChecked=0, Total=1122 [2022-01-30 22:42:36,335 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand has 34 states, 34 states have (on average 2.3823529411764706) internal successors, (81), 33 states have internal predecessors, (81), 5 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-01-30 22:42:36,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-30 22:42:36,849 INFO L93 Difference]: Finished difference Result 162 states and 170 transitions. [2022-01-30 22:42:36,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-01-30 22:42:36,850 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.3823529411764706) internal successors, (81), 33 states have internal predecessors, (81), 5 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 54 [2022-01-30 22:42:36,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-30 22:42:36,850 INFO L225 Difference]: With dead ends: 162 [2022-01-30 22:42:36,850 INFO L226 Difference]: Without dead ends: 123 [2022-01-30 22:42:36,851 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=501, Invalid=1569, Unknown=0, NotChecked=0, Total=2070 [2022-01-30 22:42:36,851 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 173 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-30 22:42:36,852 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [179 Valid, 95 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-30 22:42:36,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-01-30 22:42:36,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 80. [2022-01-30 22:42:36,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 64 states have (on average 1.0625) internal successors, (68), 65 states have internal predecessors, (68), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-01-30 22:42:36,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2022-01-30 22:42:36,862 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 54 [2022-01-30 22:42:36,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-30 22:42:36,862 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2022-01-30 22:42:36,862 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.3823529411764706) internal successors, (81), 33 states have internal predecessors, (81), 5 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-01-30 22:42:36,862 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2022-01-30 22:42:36,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-30 22:42:36,863 INFO L506 BasicCegarLoop]: Found error trace [2022-01-30 22:42:36,863 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 3, 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] [2022-01-30 22:42:36,881 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-30 22:42:37,063 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-30 22:42:37,063 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-30 22:42:37,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-30 22:42:37,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1581338092, now seen corresponding path program 8 times [2022-01-30 22:42:37,064 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-30 22:42:37,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097065744] [2022-01-30 22:42:37,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 22:42:37,064 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-30 22:42:37,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:42:37,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-30 22:42:37,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:42:37,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-30 22:42:37,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:42:37,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-30 22:42:37,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:42:37,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-01-30 22:42:37,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:42:37,331 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 4 proven. 44 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-30 22:42:37,331 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-30 22:42:37,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097065744] [2022-01-30 22:42:37,331 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097065744] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-30 22:42:37,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620078787] [2022-01-30 22:42:37,331 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-30 22:42:37,331 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 22:42:37,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-30 22:42:37,332 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-30 22:42:37,356 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-30 22:42:37,401 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-30 22:42:37,401 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-30 22:42:37,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 46 conjunts are in the unsatisfiable core [2022-01-30 22:42:37,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-30 22:42:37,417 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-30 22:42:37,468 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-30 22:42:37,492 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-30 22:42:37,512 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-30 22:42:37,534 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-30 22:42:37,561 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 6 treesize of output 5 [2022-01-30 22:42:37,570 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 6 treesize of output 5 [2022-01-30 22:42:37,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:42:37,604 INFO L353 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-01-30 22:42:37,604 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 37 [2022-01-30 22:42:38,233 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~acopy~0.base_BEFORE_CALL_23 Int) (v_main_~a~0.base_BEFORE_CALL_23 Int) (v_main_~a~0.offset_BEFORE_CALL_20 Int) (v_main_~acopy~0.offset_BEFORE_CALL_19 Int)) (and (= (select (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_23) (+ v_main_~a~0.offset_BEFORE_CALL_20 8)) (select (select |c_#memory_int| v_main_~acopy~0.base_BEFORE_CALL_23) (+ 8 v_main_~acopy~0.offset_BEFORE_CALL_19))) (not (= v_main_~acopy~0.base_BEFORE_CALL_23 v_main_~a~0.base_BEFORE_CALL_23)))) is different from true [2022-01-30 22:42:39,543 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~acopy~0.base_BEFORE_CALL_24 Int) (v_main_~a~0.base_BEFORE_CALL_24 Int) (v_main_~a~0.offset_BEFORE_CALL_21 Int) (v_main_~acopy~0.offset_BEFORE_CALL_20 Int)) (and (not (= v_main_~acopy~0.base_BEFORE_CALL_24 v_main_~a~0.base_BEFORE_CALL_24)) (= (select (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_24) (+ v_main_~a~0.offset_BEFORE_CALL_21 8)) (select (select |c_#memory_int| v_main_~acopy~0.base_BEFORE_CALL_24) (+ 8 v_main_~acopy~0.offset_BEFORE_CALL_20))))) is different from true [2022-01-30 22:42:39,627 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 34 treesize of output 10 [2022-01-30 22:42:39,654 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 4 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-01-30 22:42:39,654 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-30 22:42:39,770 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~acopy~0.offset Int) (v_ArrVal_450 (Array Int Int)) (v_ArrVal_449 Int) (~SIZE~0 Int)) (let ((.cse0 (let ((.cse1 (* c_main_~i~0 4))) (store (store (select |c_#memory_int| c_main_~acopy~0.base) (+ (* ~SIZE~0 4) (* c_main_~i~0 (- 4)) (- 4) main_~acopy~0.offset) v_ArrVal_449) (+ .cse1 main_~acopy~0.offset) (select (select (store |c_#memory_int| c_main_~acopy~0.base v_ArrVal_450) c_main_~a~0.base) (+ .cse1 c_main_~a~0.offset)))))) (= (select .cse0 (+ 8 main_~acopy~0.offset)) (select (select (store |c_#memory_int| c_main_~acopy~0.base .cse0) c_main_~a~0.base) (+ c_main_~a~0.offset 8))))) is different from false [2022-01-30 22:42:39,776 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~acopy~0.offset Int) (v_ArrVal_450 (Array Int Int)) (v_ArrVal_449 Int) (~SIZE~0 Int)) (let ((.cse0 (let ((.cse1 (* c_main_~i~0 4))) (store (store (select |c_#memory_int| c_main_~acopy~0.base) (+ (* ~SIZE~0 4) (* c_main_~i~0 (- 4)) main_~acopy~0.offset (- 8)) v_ArrVal_449) (+ .cse1 main_~acopy~0.offset 4) (select (select (store |c_#memory_int| c_main_~acopy~0.base v_ArrVal_450) c_main_~a~0.base) (+ .cse1 c_main_~a~0.offset 4)))))) (= (select (select (store |c_#memory_int| c_main_~acopy~0.base .cse0) c_main_~a~0.base) (+ c_main_~a~0.offset 8)) (select .cse0 (+ 8 main_~acopy~0.offset))))) is different from false [2022-01-30 22:42:39,806 INFO L353 Elim1Store]: treesize reduction 123, result has 37.6 percent of original size [2022-01-30 22:42:39,806 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 3 case distinctions, treesize of input 278 treesize of output 223 [2022-01-30 22:42:39,848 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_450 (Array Int Int)) (main_~acopy~0.offset Int)) (or (not (let ((.cse0 (* c_main_~i~0 4))) (= (select (select (store |c_#memory_int| c_main_~acopy~0.base v_ArrVal_450) c_main_~a~0.base) (+ .cse0 c_main_~a~0.offset 4)) (select v_arrayElimArr_1 (+ .cse0 main_~acopy~0.offset 4))))) (= (select (select (store |c_#memory_int| c_main_~acopy~0.base v_arrayElimArr_1) c_main_~a~0.base) (+ c_main_~a~0.offset 8)) (select v_arrayElimArr_1 (+ 8 main_~acopy~0.offset))))) is different from false [2022-01-30 22:42:39,857 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_450 (Array Int Int)) (main_~acopy~0.offset Int)) (or (= (select (select (store |c_#memory_int| c_main_~acopy~0.base v_arrayElimArr_1) c_main_~a~0.base) (+ c_main_~a~0.offset 8)) (select v_arrayElimArr_1 (+ 8 main_~acopy~0.offset))) (not (let ((.cse0 (* c_main_~i~0 4))) (= (select (select (store |c_#memory_int| c_main_~acopy~0.base v_ArrVal_450) c_main_~a~0.base) (+ .cse0 c_main_~a~0.offset 8)) (select v_arrayElimArr_1 (+ .cse0 8 main_~acopy~0.offset))))))) is different from false [2022-01-30 22:42:39,873 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_450 (Array Int Int)) (main_~acopy~0.offset Int)) (let ((.cse0 (+ c_main_~a~0.offset 8)) (.cse1 (select v_arrayElimArr_1 (+ 8 main_~acopy~0.offset)))) (or (= (select (select (store |c_#memory_int| c_main_~acopy~0.base v_arrayElimArr_1) c_main_~a~0.base) .cse0) .cse1) (not (= (select (select (store |c_#memory_int| c_main_~acopy~0.base v_ArrVal_450) c_main_~a~0.base) .cse0) .cse1))))) is different from false [2022-01-30 22:42:39,882 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1620078787] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-30 22:42:39,882 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-30 22:42:39,882 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 30 [2022-01-30 22:42:39,882 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758477778] [2022-01-30 22:42:39,882 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-30 22:42:39,883 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-01-30 22:42:39,883 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-30 22:42:39,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-01-30 22:42:39,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=871, Unknown=7, NotChecked=462, Total=1482 [2022-01-30 22:42:39,884 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand has 30 states, 29 states have (on average 2.7241379310344827) internal successors, (79), 27 states have internal predecessors, (79), 8 states have call successors, (11), 6 states have call predecessors, (11), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-01-30 22:42:46,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-30 22:42:46,588 INFO L93 Difference]: Finished difference Result 127 states and 135 transitions. [2022-01-30 22:42:46,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-01-30 22:42:46,589 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.7241379310344827) internal successors, (79), 27 states have internal predecessors, (79), 8 states have call successors, (11), 6 states have call predecessors, (11), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 56 [2022-01-30 22:42:46,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-30 22:42:46,590 INFO L225 Difference]: With dead ends: 127 [2022-01-30 22:42:46,590 INFO L226 Difference]: Without dead ends: 125 [2022-01-30 22:42:46,591 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 67 SyntacticMatches, 8 SemanticMatches, 55 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 712 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=309, Invalid=2156, Unknown=13, NotChecked=714, Total=3192 [2022-01-30 22:42:46,591 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 66 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 1113 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 1408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 231 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-30 22:42:46,591 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 400 Invalid, 1408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1113 Invalid, 0 Unknown, 231 Unchecked, 0.5s Time] [2022-01-30 22:42:46,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-01-30 22:42:46,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 79. [2022-01-30 22:42:46,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 63 states have (on average 1.0634920634920635) internal successors, (67), 64 states have internal predecessors, (67), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-01-30 22:42:46,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2022-01-30 22:42:46,603 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 56 [2022-01-30 22:42:46,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-30 22:42:46,603 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2022-01-30 22:42:46,604 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.7241379310344827) internal successors, (79), 27 states have internal predecessors, (79), 8 states have call successors, (11), 6 states have call predecessors, (11), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-01-30 22:42:46,604 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2022-01-30 22:42:46,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-30 22:42:46,604 INFO L506 BasicCegarLoop]: Found error trace [2022-01-30 22:42:46,604 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-30 22:42:46,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-01-30 22:42:46,812 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-30 22:42:46,812 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-30 22:42:46,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-30 22:42:46,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1424375437, now seen corresponding path program 9 times [2022-01-30 22:42:46,813 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-30 22:42:46,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107757681] [2022-01-30 22:42:46,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 22:42:46,813 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-30 22:42:46,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:42:47,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-30 22:42:47,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:42:47,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-30 22:42:47,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:42:47,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-01-30 22:42:47,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:42:47,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-01-30 22:42:47,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:42:47,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-01-30 22:42:47,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:42:47,845 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 6 proven. 38 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-30 22:42:47,845 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-30 22:42:47,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107757681] [2022-01-30 22:42:47,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107757681] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-30 22:42:47,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391174262] [2022-01-30 22:42:47,845 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-30 22:42:47,845 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 22:42:47,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-30 22:42:47,855 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-30 22:42:47,878 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-30 22:42:47,981 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-01-30 22:42:47,982 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-30 22:42:47,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 40 conjunts are in the unsatisfiable core [2022-01-30 22:42:47,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-30 22:42:47,996 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-30 22:42:48,043 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-30 22:42:48,200 INFO L353 Elim1Store]: treesize reduction 49, result has 23.4 percent of original size [2022-01-30 22:42:48,201 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 42 [2022-01-30 22:42:48,291 INFO L353 Elim1Store]: treesize reduction 145, result has 16.2 percent of original size [2022-01-30 22:42:48,292 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 2 case distinctions, treesize of input 48 treesize of output 54 [2022-01-30 22:42:56,739 INFO L353 Elim1Store]: treesize reduction 40, result has 14.9 percent of original size [2022-01-30 22:42:56,739 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 16 [2022-01-30 22:42:56,783 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 22 proven. 13 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-01-30 22:42:56,783 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-30 22:42:56,881 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391174262] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-30 22:42:56,881 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-30 22:42:56,881 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 39 [2022-01-30 22:42:56,882 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061643835] [2022-01-30 22:42:56,882 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-30 22:42:56,882 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-01-30 22:42:56,882 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-30 22:42:56,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-01-30 22:42:56,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1454, Unknown=2, NotChecked=0, Total=1640 [2022-01-30 22:42:56,883 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand has 39 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 36 states have internal predecessors, (73), 10 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-01-30 22:43:00,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-30 22:43:00,551 INFO L93 Difference]: Finished difference Result 119 states and 124 transitions. [2022-01-30 22:43:00,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-01-30 22:43:00,551 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 36 states have internal predecessors, (73), 10 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 58 [2022-01-30 22:43:00,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-30 22:43:00,552 INFO L225 Difference]: With dead ends: 119 [2022-01-30 22:43:00,552 INFO L226 Difference]: Without dead ends: 70 [2022-01-30 22:43:00,553 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 53 SyntacticMatches, 12 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1218 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=441, Invalid=3216, Unknown=3, NotChecked=0, Total=3660 [2022-01-30 22:43:00,554 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 154 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 144 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-30 22:43:00,554 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [155 Valid, 174 Invalid, 983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 720 Invalid, 0 Unknown, 144 Unchecked, 0.4s Time] [2022-01-30 22:43:00,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-01-30 22:43:00,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2022-01-30 22:43:00,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 53 states have (on average 1.0566037735849056) internal successors, (56), 54 states have internal predecessors, (56), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-30 22:43:00,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2022-01-30 22:43:00,565 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 58 [2022-01-30 22:43:00,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-30 22:43:00,566 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2022-01-30 22:43:00,566 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 36 states have internal predecessors, (73), 10 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-01-30 22:43:00,566 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2022-01-30 22:43:00,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-01-30 22:43:00,567 INFO L506 BasicCegarLoop]: Found error trace [2022-01-30 22:43:00,567 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 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] [2022-01-30 22:43:00,601 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-30 22:43:00,783 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-30 22:43:00,784 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-30 22:43:00,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-30 22:43:00,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1222210489, now seen corresponding path program 10 times [2022-01-30 22:43:00,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-30 22:43:00,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026936327] [2022-01-30 22:43:00,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 22:43:00,784 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-30 22:43:00,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:43:01,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-30 22:43:01,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:43:01,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-30 22:43:01,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:43:01,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-30 22:43:01,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:43:01,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-01-30 22:43:01,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:43:01,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-01-30 22:43:01,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:43:01,676 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 6 proven. 63 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-30 22:43:01,676 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-30 22:43:01,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026936327] [2022-01-30 22:43:01,677 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026936327] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-30 22:43:01,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173162959] [2022-01-30 22:43:01,677 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-30 22:43:01,677 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 22:43:01,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-30 22:43:01,678 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-30 22:43:01,683 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-30 22:43:01,750 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-30 22:43:01,750 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-30 22:43:01,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 41 conjunts are in the unsatisfiable core [2022-01-30 22:43:01,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-30 22:43:01,786 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-30 22:43:02,230 INFO L353 Elim1Store]: treesize reduction 45, result has 25.0 percent of original size [2022-01-30 22:43:02,231 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 40 [2022-01-30 22:43:03,265 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~a~0.offset_BEFORE_CALL_27 Int) (v_main_~a~0.base_BEFORE_CALL_32 Int) (v_main_~acopy~0.offset_BEFORE_CALL_26 Int) (aux_mod_~SIZE~0_15 Int) (v_main_~acopy~0.base_BEFORE_CALL_32 Int) (aux_div_~SIZE~0_15 Int)) (and (<= 0 aux_mod_~SIZE~0_15) (not (= v_main_~acopy~0.base_BEFORE_CALL_32 v_main_~a~0.base_BEFORE_CALL_32)) (<= (+ (* 2 aux_div_~SIZE~0_15) aux_mod_~SIZE~0_15) 6) (< 2 aux_div_~SIZE~0_15) (let ((.cse0 (* 8 aux_div_~SIZE~0_15)) (.cse1 (* aux_mod_~SIZE~0_15 4))) (= (select (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_32) (+ .cse0 v_main_~a~0.offset_BEFORE_CALL_27 (- 12) .cse1)) (select (select |c_#memory_int| v_main_~acopy~0.base_BEFORE_CALL_32) (+ .cse0 (- 12) v_main_~acopy~0.offset_BEFORE_CALL_26 .cse1)))))) is different from true [2022-01-30 22:43:10,441 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_main_~a~0.offset_BEFORE_CALL_28 Int) (v_main_~acopy~0.base_BEFORE_CALL_33 Int) (v_main_~a~0.base_BEFORE_CALL_33 Int) (v_main_~acopy~0.offset_BEFORE_CALL_27 Int) (aux_mod_~SIZE~0_15 Int) (aux_div_~SIZE~0_15 Int)) (and (<= 0 aux_mod_~SIZE~0_15) (<= (+ (* 2 aux_div_~SIZE~0_15) aux_mod_~SIZE~0_15) 6) (< 2 aux_div_~SIZE~0_15) (not (= v_main_~acopy~0.base_BEFORE_CALL_33 v_main_~a~0.base_BEFORE_CALL_33)) (let ((.cse0 (* 8 aux_div_~SIZE~0_15)) (.cse1 (* aux_mod_~SIZE~0_15 4))) (= (select (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_33) (+ .cse0 v_main_~a~0.offset_BEFORE_CALL_28 (- 12) .cse1)) (select (select |c_#memory_int| v_main_~acopy~0.base_BEFORE_CALL_33) (+ .cse0 (- 12) v_main_~acopy~0.offset_BEFORE_CALL_27 .cse1)))))) (exists ((v_aux_div_~SIZE~0_15_1 Int) (v_main_~a~0.offset_BEFORE_CALL_27 Int) (v_main_~a~0.base_BEFORE_CALL_32 Int) (v_main_~acopy~0.offset_BEFORE_CALL_26 Int) (v_main_~acopy~0.base_BEFORE_CALL_32 Int) (v_aux_mod_~SIZE~0_15_1 Int)) (and (< 2 v_aux_div_~SIZE~0_15_1) (<= 0 v_aux_mod_~SIZE~0_15_1) (<= (+ (* 2 v_aux_div_~SIZE~0_15_1) v_aux_mod_~SIZE~0_15_1) 6) (not (= v_main_~acopy~0.base_BEFORE_CALL_32 v_main_~a~0.base_BEFORE_CALL_32)) (let ((.cse2 (* 4 v_aux_mod_~SIZE~0_15_1)) (.cse3 (* 8 v_aux_div_~SIZE~0_15_1))) (= (select (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_32) (+ v_main_~a~0.offset_BEFORE_CALL_27 .cse2 .cse3 (- 12))) (select (select |c_#memory_int| v_main_~acopy~0.base_BEFORE_CALL_32) (+ .cse2 .cse3 (- 12) v_main_~acopy~0.offset_BEFORE_CALL_26))))))) is different from true [2022-01-30 22:43:16,254 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_main_~acopy~0.base_BEFORE_CALL_34 Int) (v_main_~a~0.base_BEFORE_CALL_34 Int) (aux_mod_~SIZE~0_15 Int) (aux_div_~SIZE~0_15 Int) (v_main_~acopy~0.offset_BEFORE_CALL_28 Int) (v_main_~a~0.offset_BEFORE_CALL_29 Int)) (and (<= 0 aux_mod_~SIZE~0_15) (let ((.cse0 (* 8 aux_div_~SIZE~0_15)) (.cse1 (* aux_mod_~SIZE~0_15 4))) (= (select (select |c_#memory_int| v_main_~acopy~0.base_BEFORE_CALL_34) (+ .cse0 (- 12) v_main_~acopy~0.offset_BEFORE_CALL_28 .cse1)) (select (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_34) (+ .cse0 v_main_~a~0.offset_BEFORE_CALL_29 (- 12) .cse1)))) (<= (+ (* 2 aux_div_~SIZE~0_15) aux_mod_~SIZE~0_15) 6) (< 2 aux_div_~SIZE~0_15) (not (= v_main_~acopy~0.base_BEFORE_CALL_34 v_main_~a~0.base_BEFORE_CALL_34)))) (exists ((v_aux_div_~SIZE~0_15_1 Int) (v_main_~a~0.offset_BEFORE_CALL_27 Int) (v_main_~a~0.base_BEFORE_CALL_32 Int) (v_main_~acopy~0.offset_BEFORE_CALL_26 Int) (v_main_~acopy~0.base_BEFORE_CALL_32 Int) (v_aux_mod_~SIZE~0_15_1 Int)) (and (< 2 v_aux_div_~SIZE~0_15_1) (<= 0 v_aux_mod_~SIZE~0_15_1) (<= (+ (* 2 v_aux_div_~SIZE~0_15_1) v_aux_mod_~SIZE~0_15_1) 6) (not (= v_main_~acopy~0.base_BEFORE_CALL_32 v_main_~a~0.base_BEFORE_CALL_32)) (let ((.cse2 (* 4 v_aux_mod_~SIZE~0_15_1)) (.cse3 (* 8 v_aux_div_~SIZE~0_15_1))) (= (select (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_32) (+ v_main_~a~0.offset_BEFORE_CALL_27 .cse2 .cse3 (- 12))) (select (select |c_#memory_int| v_main_~acopy~0.base_BEFORE_CALL_32) (+ .cse2 .cse3 (- 12) v_main_~acopy~0.offset_BEFORE_CALL_26))))))) is different from true [2022-01-30 22:43:20,159 INFO L353 Elim1Store]: treesize reduction 136, result has 42.6 percent of original size [2022-01-30 22:43:20,160 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 73 treesize of output 113 [2022-01-30 22:43:20,254 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 18 not checked. [2022-01-30 22:43:20,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-30 22:43:20,500 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-30 22:43:20,501 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 272 treesize of output 260 [2022-01-30 22:43:21,033 INFO L353 Elim1Store]: treesize reduction 9, result has 50.0 percent of original size [2022-01-30 22:43:21,034 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 89 [2022-01-30 22:43:21,037 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 421 treesize of output 405 [2022-01-30 22:43:21,088 INFO L353 Elim1Store]: treesize reduction 14, result has 71.4 percent of original size [2022-01-30 22:43:21,089 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1014 treesize of output 864 [2022-01-30 22:43:23,739 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 6 proven. 63 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-30 22:43:23,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1173162959] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-30 22:43:23,739 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-30 22:43:23,739 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26, 21] total 64 [2022-01-30 22:43:23,739 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769835225] [2022-01-30 22:43:23,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-30 22:43:23,740 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-01-30 22:43:23,740 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-30 22:43:23,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-01-30 22:43:23,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=427, Invalid=3237, Unknown=8, NotChecked=360, Total=4032 [2022-01-30 22:43:23,741 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. Second operand has 64 states, 63 states have (on average 2.0476190476190474) internal successors, (129), 61 states have internal predecessors, (129), 14 states have call successors, (17), 8 states have call predecessors, (17), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-01-30 22:44:02,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-30 22:44:02,753 INFO L93 Difference]: Finished difference Result 151 states and 157 transitions. [2022-01-30 22:44:02,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-01-30 22:44:02,754 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 63 states have (on average 2.0476190476190474) internal successors, (129), 61 states have internal predecessors, (129), 14 states have call successors, (17), 8 states have call predecessors, (17), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Word has length 64 [2022-01-30 22:44:02,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-30 22:44:02,754 INFO L225 Difference]: With dead ends: 151 [2022-01-30 22:44:02,754 INFO L226 Difference]: Without dead ends: 116 [2022-01-30 22:44:02,756 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 103 SyntacticMatches, 3 SemanticMatches, 94 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2172 ImplicationChecksByTransitivity, 56.3s TimeCoverageRelationStatistics Valid=919, Invalid=7617, Unknown=32, NotChecked=552, Total=9120 [2022-01-30 22:44:02,757 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 111 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 1167 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 1705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 1167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 445 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-30 22:44:02,757 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 310 Invalid, 1705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 1167 Invalid, 0 Unknown, 445 Unchecked, 0.5s Time] [2022-01-30 22:44:02,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-01-30 22:44:02,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 92. [2022-01-30 22:44:02,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 74 states have (on average 1.054054054054054) internal successors, (78), 75 states have internal predecessors, (78), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-01-30 22:44:02,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 95 transitions. [2022-01-30 22:44:02,773 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 95 transitions. Word has length 64 [2022-01-30 22:44:02,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-30 22:44:02,774 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 95 transitions. [2022-01-30 22:44:02,774 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 63 states have (on average 2.0476190476190474) internal successors, (129), 61 states have internal predecessors, (129), 14 states have call successors, (17), 8 states have call predecessors, (17), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-01-30 22:44:02,774 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 95 transitions. [2022-01-30 22:44:02,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-30 22:44:02,774 INFO L506 BasicCegarLoop]: Found error trace [2022-01-30 22:44:02,775 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 4, 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] [2022-01-30 22:44:02,794 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-30 22:44:02,986 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-30 22:44:02,986 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-30 22:44:02,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-30 22:44:02,986 INFO L85 PathProgramCache]: Analyzing trace with hash 389635749, now seen corresponding path program 11 times [2022-01-30 22:44:02,986 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-30 22:44:02,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935452987] [2022-01-30 22:44:02,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 22:44:02,987 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-30 22:44:02,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:44:03,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-30 22:44:03,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:44:03,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-30 22:44:03,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:44:03,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-01-30 22:44:03,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:44:03,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-01-30 22:44:03,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:44:03,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-01-30 22:44:03,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:44:03,269 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 31 proven. 33 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-01-30 22:44:03,269 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-30 22:44:03,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935452987] [2022-01-30 22:44:03,269 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935452987] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-30 22:44:03,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102366327] [2022-01-30 22:44:03,269 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-30 22:44:03,270 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 22:44:03,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-30 22:44:03,271 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-30 22:44:03,272 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-30 22:44:03,706 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2022-01-30 22:44:03,706 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-30 22:44:03,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 15 conjunts are in the unsatisfiable core [2022-01-30 22:44:03,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-30 22:44:04,031 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 36 proven. 22 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-01-30 22:44:04,032 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-30 22:44:04,572 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 55 proven. 9 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-01-30 22:44:04,572 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102366327] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-30 22:44:04,572 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-30 22:44:04,572 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 41 [2022-01-30 22:44:04,572 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256596922] [2022-01-30 22:44:04,572 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-30 22:44:04,573 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-01-30 22:44:04,573 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-30 22:44:04,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-01-30 22:44:04,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=336, Invalid=1304, Unknown=0, NotChecked=0, Total=1640 [2022-01-30 22:44:04,574 INFO L87 Difference]: Start difference. First operand 92 states and 95 transitions. Second operand has 41 states, 41 states have (on average 2.3658536585365852) internal successors, (97), 40 states have internal predecessors, (97), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-01-30 22:44:05,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-30 22:44:05,338 INFO L93 Difference]: Finished difference Result 197 states and 207 transitions. [2022-01-30 22:44:05,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-01-30 22:44:05,339 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.3658536585365852) internal successors, (97), 40 states have internal predecessors, (97), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 66 [2022-01-30 22:44:05,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-30 22:44:05,339 INFO L225 Difference]: With dead ends: 197 [2022-01-30 22:44:05,339 INFO L226 Difference]: Without dead ends: 164 [2022-01-30 22:44:05,340 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 119 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 891 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=673, Invalid=2407, Unknown=0, NotChecked=0, Total=3080 [2022-01-30 22:44:05,341 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 165 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 1351 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 1524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 1351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-30 22:44:05,341 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [172 Valid, 226 Invalid, 1524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 1351 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-30 22:44:05,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-01-30 22:44:05,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 94. [2022-01-30 22:44:05,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 76 states have (on average 1.0526315789473684) internal successors, (80), 77 states have internal predecessors, (80), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-01-30 22:44:05,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 97 transitions. [2022-01-30 22:44:05,360 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 97 transitions. Word has length 66 [2022-01-30 22:44:05,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-30 22:44:05,369 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 97 transitions. [2022-01-30 22:44:05,369 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.3658536585365852) internal successors, (97), 40 states have internal predecessors, (97), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-01-30 22:44:05,369 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2022-01-30 22:44:05,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-01-30 22:44:05,369 INFO L506 BasicCegarLoop]: Found error trace [2022-01-30 22:44:05,370 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 4, 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] [2022-01-30 22:44:05,389 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-01-30 22:44:05,575 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-30 22:44:05,576 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-30 22:44:05,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-30 22:44:05,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1060404445, now seen corresponding path program 12 times [2022-01-30 22:44:05,577 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-30 22:44:05,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129703955] [2022-01-30 22:44:05,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 22:44:05,577 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-30 22:44:05,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:44:05,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-30 22:44:05,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:44:05,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-30 22:44:05,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:44:05,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-01-30 22:44:05,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:44:05,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-01-30 22:44:05,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:44:05,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-01-30 22:44:05,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:44:05,897 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 17 proven. 54 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-01-30 22:44:05,897 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-30 22:44:05,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129703955] [2022-01-30 22:44:05,897 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129703955] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-30 22:44:05,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175043036] [2022-01-30 22:44:05,898 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-30 22:44:05,898 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 22:44:05,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-30 22:44:05,899 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-30 22:44:05,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-01-30 22:44:06,134 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-01-30 22:44:06,134 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-30 22:44:06,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 15 conjunts are in the unsatisfiable core [2022-01-30 22:44:06,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-30 22:44:06,427 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 16 proven. 49 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-01-30 22:44:06,427 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-30 22:44:06,839 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 22 proven. 49 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-01-30 22:44:06,839 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175043036] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-30 22:44:06,839 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-30 22:44:06,840 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 43 [2022-01-30 22:44:06,840 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623635377] [2022-01-30 22:44:06,840 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-30 22:44:06,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-01-30 22:44:06,840 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-30 22:44:06,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-01-30 22:44:06,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=1452, Unknown=0, NotChecked=0, Total=1806 [2022-01-30 22:44:06,841 INFO L87 Difference]: Start difference. First operand 94 states and 97 transitions. Second operand has 43 states, 43 states have (on average 2.302325581395349) internal successors, (99), 42 states have internal predecessors, (99), 5 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-01-30 22:44:07,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-30 22:44:07,510 INFO L93 Difference]: Finished difference Result 204 states and 214 transitions. [2022-01-30 22:44:07,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-01-30 22:44:07,510 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.302325581395349) internal successors, (99), 42 states have internal predecessors, (99), 5 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 68 [2022-01-30 22:44:07,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-30 22:44:07,513 INFO L225 Difference]: With dead ends: 204 [2022-01-30 22:44:07,513 INFO L226 Difference]: Without dead ends: 155 [2022-01-30 22:44:07,514 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1003 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=784, Invalid=2522, Unknown=0, NotChecked=0, Total=3306 [2022-01-30 22:44:07,514 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 300 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-30 22:44:07,514 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [308 Valid, 100 Invalid, 978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 671 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-30 22:44:07,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-01-30 22:44:07,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 96. [2022-01-30 22:44:07,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 78 states have (on average 1.0512820512820513) internal successors, (82), 79 states have internal predecessors, (82), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-01-30 22:44:07,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 99 transitions. [2022-01-30 22:44:07,533 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 99 transitions. Word has length 68 [2022-01-30 22:44:07,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-30 22:44:07,533 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 99 transitions. [2022-01-30 22:44:07,533 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.302325581395349) internal successors, (99), 42 states have internal predecessors, (99), 5 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-01-30 22:44:07,533 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 99 transitions. [2022-01-30 22:44:07,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-01-30 22:44:07,534 INFO L506 BasicCegarLoop]: Found error trace [2022-01-30 22:44:07,534 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 4, 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] [2022-01-30 22:44:07,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-01-30 22:44:07,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 22:44:07,748 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-30 22:44:07,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-30 22:44:07,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1548875393, now seen corresponding path program 13 times [2022-01-30 22:44:07,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-30 22:44:07,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529276] [2022-01-30 22:44:07,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 22:44:07,748 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-30 22:44:07,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:44:08,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-30 22:44:08,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:44:08,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-01-30 22:44:08,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:44:08,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-01-30 22:44:08,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:44:08,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-01-30 22:44:08,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:44:08,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-01-30 22:44:08,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:44:08,631 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 8 proven. 96 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-30 22:44:08,631 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-30 22:44:08,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529276] [2022-01-30 22:44:08,632 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529276] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-30 22:44:08,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678734752] [2022-01-30 22:44:08,632 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-30 22:44:08,632 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 22:44:08,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-30 22:44:08,648 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-30 22:44:08,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-01-30 22:44:08,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:44:08,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 41 conjunts are in the unsatisfiable core [2022-01-30 22:44:08,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-30 22:44:08,744 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-30 22:44:08,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:44:08,877 INFO L353 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-01-30 22:44:08,880 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 37 [2022-01-30 22:44:09,503 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~acopy~0.offset_BEFORE_CALL_32 Int) (v_main_~a~0.offset_BEFORE_CALL_33 Int) (v_main_~acopy~0.base_BEFORE_CALL_40 Int) (v_main_~a~0.base_BEFORE_CALL_40 Int)) (and (not (= v_main_~acopy~0.base_BEFORE_CALL_40 v_main_~a~0.base_BEFORE_CALL_40)) (= (select (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_40) (+ v_main_~a~0.offset_BEFORE_CALL_33 12)) (select (select |c_#memory_int| v_main_~acopy~0.base_BEFORE_CALL_40) (+ 12 v_main_~acopy~0.offset_BEFORE_CALL_32))))) is different from true [2022-01-30 22:44:10,922 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~a~0.base_BEFORE_CALL_41 Int) (v_main_~acopy~0.offset_BEFORE_CALL_33 Int) (v_main_~a~0.offset_BEFORE_CALL_34 Int) (v_main_~acopy~0.base_BEFORE_CALL_41 Int)) (and (= (select (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_41) (+ v_main_~a~0.offset_BEFORE_CALL_34 12)) (select (select |c_#memory_int| v_main_~acopy~0.base_BEFORE_CALL_41) (+ 12 v_main_~acopy~0.offset_BEFORE_CALL_33))) (not (= v_main_~acopy~0.base_BEFORE_CALL_41 v_main_~a~0.base_BEFORE_CALL_41)))) is different from true [2022-01-30 22:44:12,330 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~a~0.base_BEFORE_CALL_42 Int) (v_main_~a~0.offset_BEFORE_CALL_35 Int) (v_main_~acopy~0.offset_BEFORE_CALL_34 Int) (v_main_~acopy~0.base_BEFORE_CALL_42 Int)) (and (not (= v_main_~acopy~0.base_BEFORE_CALL_42 v_main_~a~0.base_BEFORE_CALL_42)) (= (select (select |c_#memory_int| v_main_~acopy~0.base_BEFORE_CALL_42) (+ 12 v_main_~acopy~0.offset_BEFORE_CALL_34)) (select (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_42) (+ v_main_~a~0.offset_BEFORE_CALL_35 12))))) is different from true [2022-01-30 22:44:13,157 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 34 treesize of output 10 [2022-01-30 22:44:13,194 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 73 refuted. 0 times theorem prover too weak. 25 trivial. 18 not checked. [2022-01-30 22:44:13,194 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-30 22:44:13,369 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-30 22:44:13,370 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 450 treesize of output 426 [2022-01-30 22:44:13,373 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 418 treesize of output 382 [2022-01-30 22:44:14,307 INFO L353 Elim1Store]: treesize reduction 9, result has 35.7 percent of original size [2022-01-30 22:44:14,307 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 61 [2022-01-30 22:44:14,338 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-30 22:44:14,339 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 456 treesize of output 436 [2022-01-30 22:44:14,946 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 6 proven. 34 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-01-30 22:44:14,947 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678734752] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-30 22:44:14,947 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-30 22:44:14,947 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 18, 15] total 46 [2022-01-30 22:44:14,947 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571787332] [2022-01-30 22:44:14,947 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-30 22:44:14,947 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-01-30 22:44:14,947 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-30 22:44:14,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-01-30 22:44:14,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=1620, Unknown=3, NotChecked=252, Total=2070 [2022-01-30 22:44:14,948 INFO L87 Difference]: Start difference. First operand 96 states and 99 transitions. Second operand has 46 states, 45 states have (on average 2.466666666666667) internal successors, (111), 43 states have internal predecessors, (111), 13 states have call successors, (16), 7 states have call predecessors, (16), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-01-30 22:44:25,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-30 22:44:25,038 INFO L93 Difference]: Finished difference Result 206 states and 226 transitions. [2022-01-30 22:44:25,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-01-30 22:44:25,039 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.466666666666667) internal successors, (111), 43 states have internal predecessors, (111), 13 states have call successors, (16), 7 states have call predecessors, (16), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 70 [2022-01-30 22:44:25,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-30 22:44:25,040 INFO L225 Difference]: With dead ends: 206 [2022-01-30 22:44:25,040 INFO L226 Difference]: Without dead ends: 204 [2022-01-30 22:44:25,041 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 125 SyntacticMatches, 10 SemanticMatches, 91 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2428 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=990, Invalid=7023, Unknown=9, NotChecked=534, Total=8556 [2022-01-30 22:44:25,042 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 254 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 1810 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 2546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 1810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 485 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-30 22:44:25,042 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [255 Valid, 421 Invalid, 2546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 1810 Invalid, 0 Unknown, 485 Unchecked, 0.8s Time] [2022-01-30 22:44:25,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-01-30 22:44:25,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 151. [2022-01-30 22:44:25,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 121 states have (on average 1.0495867768595042) internal successors, (127), 124 states have internal predecessors, (127), 17 states have call successors, (17), 13 states have call predecessors, (17), 12 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2022-01-30 22:44:25,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 160 transitions. [2022-01-30 22:44:25,082 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 160 transitions. Word has length 70 [2022-01-30 22:44:25,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-30 22:44:25,082 INFO L470 AbstractCegarLoop]: Abstraction has 151 states and 160 transitions. [2022-01-30 22:44:25,083 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.466666666666667) internal successors, (111), 43 states have internal predecessors, (111), 13 states have call successors, (16), 7 states have call predecessors, (16), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-01-30 22:44:25,083 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 160 transitions. [2022-01-30 22:44:25,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-01-30 22:44:25,084 INFO L506 BasicCegarLoop]: Found error trace [2022-01-30 22:44:25,084 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 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] [2022-01-30 22:44:25,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-01-30 22:44:25,301 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-01-30 22:44:25,301 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-30 22:44:25,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-30 22:44:25,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1169589114, now seen corresponding path program 14 times [2022-01-30 22:44:25,302 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-30 22:44:25,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703529800] [2022-01-30 22:44:25,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 22:44:25,302 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-30 22:44:25,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:44:26,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-30 22:44:26,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:44:26,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-30 22:44:26,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:44:26,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-30 22:44:26,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:44:26,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-01-30 22:44:26,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:44:26,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-01-30 22:44:26,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:44:26,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-01-30 22:44:26,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:44:26,474 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 8 proven. 77 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-30 22:44:26,474 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-30 22:44:26,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703529800] [2022-01-30 22:44:26,474 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703529800] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-30 22:44:26,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678316576] [2022-01-30 22:44:26,475 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-30 22:44:26,475 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 22:44:26,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-30 22:44:26,476 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-30 22:44:26,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-01-30 22:44:26,571 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-30 22:44:26,571 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-30 22:44:26,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 57 conjunts are in the unsatisfiable core [2022-01-30 22:44:26,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-30 22:44:26,583 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-30 22:44:26,727 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-30 22:44:26,761 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-30 22:44:26,958 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 6 treesize of output 5 [2022-01-30 22:44:27,016 INFO L353 Elim1Store]: treesize reduction 49, result has 23.4 percent of original size [2022-01-30 22:44:27,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 1 case distinctions, treesize of input 38 treesize of output 42 [2022-01-30 22:44:27,134 INFO L353 Elim1Store]: treesize reduction 120, result has 17.2 percent of original size [2022-01-30 22:44:27,135 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 2 case distinctions, treesize of input 43 treesize of output 49 [2022-01-30 22:44:27,956 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~a~0.offset_BEFORE_CALL_39 Int) (v_main_~a~0.base_BEFORE_CALL_48 Int) (v_main_~acopy~0.base_BEFORE_CALL_48 Int) (v_main_~acopy~0.offset_BEFORE_CALL_38 Int) (~SIZE~0 Int)) (and (let ((.cse0 (* ~SIZE~0 4))) (= (select (select |c_#memory_int| v_main_~acopy~0.base_BEFORE_CALL_48) (+ .cse0 v_main_~acopy~0.offset_BEFORE_CALL_38 (- 8))) (select (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_48) (+ v_main_~a~0.offset_BEFORE_CALL_39 .cse0 (- 8))))) (not (= v_main_~acopy~0.base_BEFORE_CALL_48 v_main_~a~0.base_BEFORE_CALL_48)) (< 5 ~SIZE~0) (<= ~SIZE~0 6))) is different from true [2022-01-30 22:44:34,384 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_main_~acopy~0.base_BEFORE_CALL_49 Int) (v_main_~a~0.base_BEFORE_CALL_49 Int) (v_main_~a~0.offset_BEFORE_CALL_40 Int) (~SIZE~0 Int) (v_main_~acopy~0.offset_BEFORE_CALL_39 Int)) (and (not (= v_main_~acopy~0.base_BEFORE_CALL_49 v_main_~a~0.base_BEFORE_CALL_49)) (let ((.cse0 (* ~SIZE~0 4))) (= (select (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_49) (+ v_main_~a~0.offset_BEFORE_CALL_40 .cse0 (- 8))) (select (select |c_#memory_int| v_main_~acopy~0.base_BEFORE_CALL_49) (+ .cse0 v_main_~acopy~0.offset_BEFORE_CALL_39 (- 8))))) (< 5 ~SIZE~0) (<= ~SIZE~0 6))) (exists ((v_main_~a~0.offset_BEFORE_CALL_39 Int) (v_main_~a~0.base_BEFORE_CALL_48 Int) (v_main_~acopy~0.base_BEFORE_CALL_48 Int) (v_main_~acopy~0.offset_BEFORE_CALL_38 Int) (v_~SIZE~0_55 Int)) (and (let ((.cse1 (* v_~SIZE~0_55 4))) (= (select (select |c_#memory_int| v_main_~acopy~0.base_BEFORE_CALL_48) (+ .cse1 v_main_~acopy~0.offset_BEFORE_CALL_38 (- 8))) (select (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_48) (+ v_main_~a~0.offset_BEFORE_CALL_39 .cse1 (- 8))))) (<= v_~SIZE~0_55 6) (not (= v_main_~acopy~0.base_BEFORE_CALL_48 v_main_~a~0.base_BEFORE_CALL_48)) (< 5 v_~SIZE~0_55)))) is different from true [2022-01-30 22:44:38,665 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_main_~acopy~0.offset_BEFORE_CALL_40 Int) (v_main_~acopy~0.base_BEFORE_CALL_50 Int) (v_main_~a~0.offset_BEFORE_CALL_41 Int) (~SIZE~0 Int) (v_main_~a~0.base_BEFORE_CALL_50 Int)) (and (let ((.cse0 (* ~SIZE~0 4))) (= (select (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_50) (+ v_main_~a~0.offset_BEFORE_CALL_41 .cse0 (- 8))) (select (select |c_#memory_int| v_main_~acopy~0.base_BEFORE_CALL_50) (+ .cse0 v_main_~acopy~0.offset_BEFORE_CALL_40 (- 8))))) (< 5 ~SIZE~0) (<= ~SIZE~0 6) (not (= v_main_~acopy~0.base_BEFORE_CALL_50 v_main_~a~0.base_BEFORE_CALL_50)))) (exists ((v_main_~a~0.offset_BEFORE_CALL_39 Int) (v_main_~a~0.base_BEFORE_CALL_48 Int) (v_main_~acopy~0.base_BEFORE_CALL_48 Int) (v_main_~acopy~0.offset_BEFORE_CALL_38 Int) (v_~SIZE~0_55 Int)) (and (let ((.cse1 (* v_~SIZE~0_55 4))) (= (select (select |c_#memory_int| v_main_~acopy~0.base_BEFORE_CALL_48) (+ .cse1 v_main_~acopy~0.offset_BEFORE_CALL_38 (- 8))) (select (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_48) (+ v_main_~a~0.offset_BEFORE_CALL_39 .cse1 (- 8))))) (<= v_~SIZE~0_55 6) (not (= v_main_~acopy~0.base_BEFORE_CALL_48 v_main_~a~0.base_BEFORE_CALL_48)) (< 5 v_~SIZE~0_55)))) is different from true [2022-01-30 22:44:43,104 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_main_~acopy~0.offset_BEFORE_CALL_41 Int) (v_main_~a~0.offset_BEFORE_CALL_42 Int) (~SIZE~0 Int) (v_main_~acopy~0.base_BEFORE_CALL_51 Int) (v_main_~a~0.base_BEFORE_CALL_51 Int)) (and (not (= v_main_~acopy~0.base_BEFORE_CALL_51 v_main_~a~0.base_BEFORE_CALL_51)) (< 5 ~SIZE~0) (<= ~SIZE~0 6) (let ((.cse0 (* ~SIZE~0 4))) (= (select (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_51) (+ v_main_~a~0.offset_BEFORE_CALL_42 .cse0 (- 8))) (select (select |c_#memory_int| v_main_~acopy~0.base_BEFORE_CALL_51) (+ .cse0 v_main_~acopy~0.offset_BEFORE_CALL_41 (- 8))))))) (exists ((v_main_~a~0.offset_BEFORE_CALL_39 Int) (v_main_~a~0.base_BEFORE_CALL_48 Int) (v_main_~acopy~0.base_BEFORE_CALL_48 Int) (v_main_~acopy~0.offset_BEFORE_CALL_38 Int) (v_~SIZE~0_55 Int)) (and (let ((.cse1 (* v_~SIZE~0_55 4))) (= (select (select |c_#memory_int| v_main_~acopy~0.base_BEFORE_CALL_48) (+ .cse1 v_main_~acopy~0.offset_BEFORE_CALL_38 (- 8))) (select (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_48) (+ v_main_~a~0.offset_BEFORE_CALL_39 .cse1 (- 8))))) (<= v_~SIZE~0_55 6) (not (= v_main_~acopy~0.base_BEFORE_CALL_48 v_main_~a~0.base_BEFORE_CALL_48)) (< 5 v_~SIZE~0_55)))) is different from true [2022-01-30 22:44:44,464 INFO L353 Elim1Store]: treesize reduction 112, result has 42.6 percent of original size [2022-01-30 22:44:44,464 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 61 treesize of output 95 [2022-01-30 22:44:44,565 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 32 not checked. [2022-01-30 22:44:44,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-30 22:46:14,740 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_883 Int) (main_~acopy~0.offset Int) (v_ArrVal_889 Int) (v_ArrVal_887 Int)) (let ((.cse0 (let ((.cse3 (* c_main_~i~0 4))) (store (let ((.cse1 (* c_main_~i~0 (- 4))) (.cse2 (* 4 c_~SIZE~0))) (store (store (store (select |c_#memory_int| c_main_~acopy~0.base) (+ .cse1 .cse2 main_~acopy~0.offset (- 8)) (select (select |c_#memory_int| c_main_~a~0.base) (+ .cse1 c_main_~a~0.offset .cse2 (- 8)))) (+ .cse3 main_~acopy~0.offset 4) v_ArrVal_883) (+ .cse1 (- 12) .cse2 main_~acopy~0.offset) v_ArrVal_889)) (+ .cse3 8 main_~acopy~0.offset) v_ArrVal_887)))) (= (select (select (store |c_#memory_int| c_main_~acopy~0.base .cse0) c_main_~a~0.base) (+ c_main_~a~0.offset 16)) (select .cse0 (+ 16 main_~acopy~0.offset))))) is different from false [2022-01-30 22:46:14,753 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_883 Int) (main_~acopy~0.offset Int) (v_ArrVal_889 Int) (v_ArrVal_882 (Array Int Int)) (v_ArrVal_887 Int)) (let ((.cse0 (let ((.cse3 (* c_main_~i~0 4))) (store (let ((.cse1 (* c_main_~i~0 (- 4))) (.cse2 (* 4 c_~SIZE~0))) (store (store (store v_ArrVal_882 (+ .cse1 .cse2 main_~acopy~0.offset (- 8)) (select (select (store |c_#memory_int| c_main_~acopy~0.base v_ArrVal_882) c_main_~a~0.base) (+ .cse1 c_main_~a~0.offset .cse2 (- 8)))) (+ .cse3 main_~acopy~0.offset 4) v_ArrVal_883) (+ .cse1 (- 12) .cse2 main_~acopy~0.offset) v_ArrVal_889)) (+ .cse3 8 main_~acopy~0.offset) v_ArrVal_887)))) (= (select (select (store |c_#memory_int| c_main_~acopy~0.base .cse0) c_main_~a~0.base) (+ c_main_~a~0.offset 16)) (select .cse0 (+ 16 main_~acopy~0.offset))))) is different from false [2022-01-30 22:46:14,765 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_883 Int) (main_~acopy~0.offset Int) (v_ArrVal_889 Int) (v_ArrVal_882 (Array Int Int)) (v_ArrVal_887 Int)) (let ((.cse0 (store (let ((.cse1 (* 4 c_~SIZE~0))) (store (store (store v_ArrVal_882 (+ .cse1 main_~acopy~0.offset (- 8)) (select (select (store |c_#memory_int| c_main_~acopy~0.base v_ArrVal_882) c_main_~a~0.base) (+ c_main_~a~0.offset .cse1 (- 8)))) (+ main_~acopy~0.offset 4) v_ArrVal_883) (+ (- 12) .cse1 main_~acopy~0.offset) v_ArrVal_889)) (+ 8 main_~acopy~0.offset) v_ArrVal_887))) (= (select .cse0 (+ 16 main_~acopy~0.offset)) (select (select (store |c_#memory_int| c_main_~acopy~0.base .cse0) c_main_~a~0.base) (+ c_main_~a~0.offset 16))))) is different from false [2022-01-30 22:46:14,778 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678316576] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-30 22:46:14,778 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-30 22:46:14,778 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 30] total 53 [2022-01-30 22:46:14,778 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333221109] [2022-01-30 22:46:14,778 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-30 22:46:14,778 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-01-30 22:46:14,778 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-30 22:46:14,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-01-30 22:46:14,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=3060, Unknown=55, NotChecked=826, Total=4160 [2022-01-30 22:46:14,779 INFO L87 Difference]: Start difference. First operand 151 states and 160 transitions. Second operand has 53 states, 52 states have (on average 2.0) internal successors, (104), 50 states have internal predecessors, (104), 12 states have call successors, (15), 9 states have call predecessors, (15), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-01-30 22:47:39,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-30 22:47:39,669 INFO L93 Difference]: Finished difference Result 167 states and 175 transitions. [2022-01-30 22:47:39,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-01-30 22:47:39,669 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 2.0) internal successors, (104), 50 states have internal predecessors, (104), 12 states have call successors, (15), 9 states have call predecessors, (15), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Word has length 72 [2022-01-30 22:47:39,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-30 22:47:39,670 INFO L225 Difference]: With dead ends: 167 [2022-01-30 22:47:39,670 INFO L226 Difference]: Without dead ends: 165 [2022-01-30 22:47:39,671 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 90 SyntacticMatches, 8 SemanticMatches, 97 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1920 ImplicationChecksByTransitivity, 191.2s TimeCoverageRelationStatistics Valid=603, Invalid=7703, Unknown=94, NotChecked=1302, Total=9702 [2022-01-30 22:47:39,671 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 93 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 1112 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 1827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 636 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-30 22:47:39,671 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 344 Invalid, 1827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1112 Invalid, 0 Unknown, 636 Unchecked, 0.6s Time] [2022-01-30 22:47:39,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-01-30 22:47:39,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 104. [2022-01-30 22:47:39,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 84 states have (on average 1.0476190476190477) internal successors, (88), 85 states have internal predecessors, (88), 10 states have call successors, (10), 10 states have call predecessors, (10), 9 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-01-30 22:47:39,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 107 transitions. [2022-01-30 22:47:39,693 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 107 transitions. Word has length 72 [2022-01-30 22:47:39,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-30 22:47:39,693 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 107 transitions. [2022-01-30 22:47:39,693 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 2.0) internal successors, (104), 50 states have internal predecessors, (104), 12 states have call successors, (15), 9 states have call predecessors, (15), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-01-30 22:47:39,693 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 107 transitions. [2022-01-30 22:47:39,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-01-30 22:47:39,694 INFO L506 BasicCegarLoop]: Found error trace [2022-01-30 22:47:39,694 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 5, 5, 5, 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] [2022-01-30 22:47:39,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-01-30 22:47:39,906 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-01-30 22:47:39,907 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-30 22:47:39,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-30 22:47:39,907 INFO L85 PathProgramCache]: Analyzing trace with hash 2102989748, now seen corresponding path program 15 times [2022-01-30 22:47:39,907 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-30 22:47:39,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381089123] [2022-01-30 22:47:39,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 22:47:39,908 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-30 22:47:39,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:47:41,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-30 22:47:41,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:47:41,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-01-30 22:47:41,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:47:41,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-01-30 22:47:41,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:47:41,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-01-30 22:47:41,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:47:41,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-01-30 22:47:41,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:47:41,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-01-30 22:47:41,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:47:41,480 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 10 proven. 110 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-30 22:47:41,480 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-30 22:47:41,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381089123] [2022-01-30 22:47:41,480 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381089123] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-30 22:47:41,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589183627] [2022-01-30 22:47:41,480 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-30 22:47:41,480 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 22:47:41,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-30 22:47:41,484 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-30 22:47:41,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-01-30 22:47:41,733 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-01-30 22:47:41,734 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-30 22:47:41,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 46 conjunts are in the unsatisfiable core [2022-01-30 22:47:41,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-30 22:47:41,750 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-30 22:47:42,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:47:42,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:47:42,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:47:42,273 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 53