/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/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/list-simple/dll2c_update_all_reverse.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 00:53:56,591 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 00:53:56,593 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 00:53:56,656 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 00:53:56,656 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 00:53:56,658 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 00:53:56,661 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 00:53:56,665 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 00:53:56,667 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 00:53:56,670 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 00:53:56,671 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 00:53:56,672 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 00:53:56,672 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 00:53:56,674 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 00:53:56,675 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 00:53:56,678 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 00:53:56,679 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 00:53:56,680 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 00:53:56,682 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 00:53:56,688 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 00:53:56,689 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 00:53:56,690 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 00:53:56,691 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 00:53:56,692 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 00:53:56,698 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 00:53:56,698 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 00:53:56,698 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 00:53:56,699 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 00:53:56,700 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 00:53:56,700 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 00:53:56,700 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 00:53:56,701 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 00:53:56,701 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 00:53:56,702 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 00:53:56,703 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 00:53:56,703 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 00:53:56,703 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 00:53:56,703 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 00:53:56,704 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 00:53:56,704 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 00:53:56,705 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 00:53:56,707 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf [2022-01-10 00:53:56,740 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 00:53:56,740 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 00:53:56,741 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 00:53:56,741 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 00:53:56,741 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 00:53:56,741 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 00:53:56,742 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 00:53:56,742 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 00:53:56,742 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 00:53:56,742 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 00:53:56,743 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 00:53:56,743 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 00:53:56,743 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 00:53:56,743 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 00:53:56,743 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 00:53:56,744 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 00:53:56,744 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 00:53:56,744 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 00:53:56,744 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 00:53:56,744 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 00:53:56,744 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 00:53:56,744 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 00:53:56,745 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 00:53:56,745 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 00:53:56,746 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 00:53:56,746 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 00:53:56,746 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 00:53:56,746 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 00:53:56,746 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 00:53:56,746 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 00:53:56,746 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-10 00:53:56,938 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 00:53:56,954 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 00:53:56,955 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 00:53:56,956 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 00:53:56,957 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 00:53:56,958 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2c_update_all_reverse.i [2022-01-10 00:53:57,015 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c97ea5c56/f44bd76166944213948c4d69678d9929/FLAG07b0785d6 [2022-01-10 00:53:57,495 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 00:53:57,495 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_update_all_reverse.i [2022-01-10 00:53:57,507 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c97ea5c56/f44bd76166944213948c4d69678d9929/FLAG07b0785d6 [2022-01-10 00:53:57,989 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c97ea5c56/f44bd76166944213948c4d69678d9929 [2022-01-10 00:53:57,991 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 00:53:57,992 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 00:53:57,995 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 00:53:57,995 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 00:53:57,997 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 00:53:57,998 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:53:57" (1/1) ... [2022-01-10 00:53:57,999 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b7ad68d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:57, skipping insertion in model container [2022-01-10 00:53:57,999 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:53:57" (1/1) ... [2022-01-10 00:53:58,008 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 00:53:58,037 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 00:53:58,397 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_update_all_reverse.i[24556,24569] [2022-01-10 00:53:58,401 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 00:53:58,413 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 00:53:58,470 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_update_all_reverse.i[24556,24569] [2022-01-10 00:53:58,471 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 00:53:58,496 INFO L208 MainTranslator]: Completed translation [2022-01-10 00:53:58,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:58 WrapperNode [2022-01-10 00:53:58,498 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 00:53:58,499 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 00:53:58,499 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 00:53:58,499 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 00:53:58,506 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:58" (1/1) ... [2022-01-10 00:53:58,535 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:58" (1/1) ... [2022-01-10 00:53:58,564 INFO L137 Inliner]: procedures = 126, calls = 29, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 131 [2022-01-10 00:53:58,565 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 00:53:58,565 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 00:53:58,565 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 00:53:58,566 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 00:53:58,573 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:58" (1/1) ... [2022-01-10 00:53:58,573 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:58" (1/1) ... [2022-01-10 00:53:58,588 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:58" (1/1) ... [2022-01-10 00:53:58,589 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:58" (1/1) ... [2022-01-10 00:53:58,598 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:58" (1/1) ... [2022-01-10 00:53:58,601 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:58" (1/1) ... [2022-01-10 00:53:58,602 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:58" (1/1) ... [2022-01-10 00:53:58,604 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 00:53:58,605 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 00:53:58,605 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 00:53:58,605 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 00:53:58,612 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:58" (1/1) ... [2022-01-10 00:53:58,618 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 00:53:58,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:53:58,647 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-10 00:53:58,676 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-10 00:53:58,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-10 00:53:58,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-10 00:53:58,696 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-01-10 00:53:58,697 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-01-10 00:53:58,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 00:53:58,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 00:53:58,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 00:53:58,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 00:53:58,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 00:53:58,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-10 00:53:58,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 00:53:58,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 00:53:58,848 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 00:53:58,850 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 00:53:59,053 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 00:53:59,058 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 00:53:59,058 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-01-10 00:53:59,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:53:59 BoogieIcfgContainer [2022-01-10 00:53:59,060 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 00:53:59,061 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 00:53:59,061 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 00:53:59,066 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 00:53:59,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:53:57" (1/3) ... [2022-01-10 00:53:59,067 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d93d04b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:53:59, skipping insertion in model container [2022-01-10 00:53:59,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:58" (2/3) ... [2022-01-10 00:53:59,067 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d93d04b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:53:59, skipping insertion in model container [2022-01-10 00:53:59,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:53:59" (3/3) ... [2022-01-10 00:53:59,069 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2c_update_all_reverse.i [2022-01-10 00:53:59,073 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 00:53:59,073 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 00:53:59,112 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 00:53:59,118 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-10 00:53:59,119 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 00:53:59,132 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 34 states have (on average 1.5) internal successors, (51), 35 states have internal predecessors, (51), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 00:53:59,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-10 00:53:59,137 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:53:59,137 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] [2022-01-10 00:53:59,138 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:53:59,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:53:59,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1387430191, now seen corresponding path program 1 times [2022-01-10 00:53:59,150 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:53:59,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163741962] [2022-01-10 00:53:59,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:53:59,151 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:53:59,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:53:59,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 00:53:59,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:53:59,407 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-10 00:53:59,407 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:53:59,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163741962] [2022-01-10 00:53:59,409 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163741962] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:53:59,409 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:53:59,409 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:53:59,411 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34471041] [2022-01-10 00:53:59,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:53:59,415 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:53:59,415 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:53:59,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:53:59,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:53:59,446 INFO L87 Difference]: Start difference. First operand has 39 states, 34 states have (on average 1.5) internal successors, (51), 35 states have internal predecessors, (51), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 00:53:59,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:53:59,517 INFO L93 Difference]: Finished difference Result 63 states and 90 transitions. [2022-01-10 00:53:59,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:53:59,519 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-01-10 00:53:59,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:53:59,524 INFO L225 Difference]: With dead ends: 63 [2022-01-10 00:53:59,525 INFO L226 Difference]: Without dead ends: 30 [2022-01-10 00:53:59,527 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:53:59,529 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:53:59,530 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 00:53:59,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-01-10 00:53:59,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-01-10 00:53:59,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 00:53:59,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-01-10 00:53:59,571 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 20 [2022-01-10 00:53:59,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:53:59,572 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-01-10 00:53:59,572 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 00:53:59,572 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-01-10 00:53:59,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-10 00:53:59,574 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:53:59,574 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] [2022-01-10 00:53:59,574 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 00:53:59,575 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:53:59,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:53:59,577 INFO L85 PathProgramCache]: Analyzing trace with hash 498100996, now seen corresponding path program 1 times [2022-01-10 00:53:59,577 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:53:59,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110901791] [2022-01-10 00:53:59,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:53:59,578 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:53:59,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:53:59,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 00:53:59,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:53:59,708 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-10 00:53:59,709 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:53:59,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110901791] [2022-01-10 00:53:59,709 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110901791] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:53:59,710 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:53:59,710 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 00:53:59,710 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612533715] [2022-01-10 00:53:59,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:53:59,712 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 00:53:59,712 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:53:59,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 00:53:59,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 00:53:59,713 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 00:53:59,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:53:59,754 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2022-01-10 00:53:59,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 00:53:59,755 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-01-10 00:53:59,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:53:59,757 INFO L225 Difference]: With dead ends: 51 [2022-01-10 00:53:59,757 INFO L226 Difference]: Without dead ends: 35 [2022-01-10 00:53:59,761 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-10 00:53:59,763 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 4 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:53:59,763 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 86 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 00:53:59,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-01-10 00:53:59,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2022-01-10 00:53:59,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 00:53:59,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2022-01-10 00:53:59,769 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 20 [2022-01-10 00:53:59,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:53:59,769 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2022-01-10 00:53:59,769 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 00:53:59,770 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2022-01-10 00:53:59,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-10 00:53:59,770 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:53:59,771 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-10 00:53:59,771 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 00:53:59,771 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:53:59,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:53:59,771 INFO L85 PathProgramCache]: Analyzing trace with hash 698671896, now seen corresponding path program 1 times [2022-01-10 00:53:59,772 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:53:59,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064172225] [2022-01-10 00:53:59,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:53:59,772 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:53:59,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:53:59,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 00:53:59,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:53:59,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 00:53:59,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:53:59,879 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-10 00:53:59,879 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:53:59,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064172225] [2022-01-10 00:53:59,880 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064172225] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:53:59,880 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:53:59,880 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 00:53:59,880 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365865311] [2022-01-10 00:53:59,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:53:59,881 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 00:53:59,881 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:53:59,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 00:53:59,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-10 00:53:59,882 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-10 00:53:59,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:53:59,972 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2022-01-10 00:53:59,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 00:53:59,975 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-01-10 00:53:59,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:53:59,976 INFO L225 Difference]: With dead ends: 53 [2022-01-10 00:53:59,976 INFO L226 Difference]: Without dead ends: 44 [2022-01-10 00:53:59,976 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-10 00:53:59,977 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 45 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 00:53:59,978 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 72 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 00:53:59,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-01-10 00:53:59,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 32. [2022-01-10 00:53:59,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 00:53:59,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-01-10 00:53:59,987 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 30 [2022-01-10 00:53:59,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:53:59,987 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-01-10 00:53:59,988 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-10 00:53:59,988 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-01-10 00:53:59,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-10 00:53:59,988 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:53:59,989 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:53:59,989 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 00:53:59,989 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:53:59,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:53:59,989 INFO L85 PathProgramCache]: Analyzing trace with hash 143562896, now seen corresponding path program 1 times [2022-01-10 00:53:59,989 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:53:59,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051022166] [2022-01-10 00:53:59,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:53:59,990 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:54:00,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:54:00,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 00:54:00,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:54:00,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 00:54:00,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:54:00,166 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-10 00:54:00,166 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:54:00,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051022166] [2022-01-10 00:54:00,167 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051022166] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:54:00,167 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:54:00,167 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 00:54:00,167 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153825834] [2022-01-10 00:54:00,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:54:00,168 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 00:54:00,168 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:54:00,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 00:54:00,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-10 00:54:00,169 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-10 00:54:00,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:54:00,219 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2022-01-10 00:54:00,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 00:54:00,220 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2022-01-10 00:54:00,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:54:00,221 INFO L225 Difference]: With dead ends: 59 [2022-01-10 00:54:00,221 INFO L226 Difference]: Without dead ends: 45 [2022-01-10 00:54:00,221 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-10 00:54:00,222 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 45 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:54:00,223 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 88 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 00:54:00,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-01-10 00:54:00,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 33. [2022-01-10 00:54:00,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 00:54:00,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2022-01-10 00:54:00,229 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 35 [2022-01-10 00:54:00,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:54:00,229 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-01-10 00:54:00,229 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-10 00:54:00,230 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-01-10 00:54:00,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-10 00:54:00,230 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:54:00,230 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:54:00,231 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 00:54:00,231 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:54:00,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:54:00,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1641789207, now seen corresponding path program 1 times [2022-01-10 00:54:00,231 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:54:00,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875835018] [2022-01-10 00:54:00,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:54:00,232 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:54:00,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:54:00,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 00:54:00,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:54:00,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 00:54:00,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:54:00,324 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-10 00:54:00,324 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:54:00,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875835018] [2022-01-10 00:54:00,325 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875835018] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:54:00,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342980010] [2022-01-10 00:54:00,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:54:00,325 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:54:00,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:54:00,327 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-10 00:54:00,332 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-10 00:54:00,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:54:00,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 00:54:00,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:54:00,592 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-10 00:54:00,592 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:54:00,690 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-10 00:54:00,691 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342980010] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 00:54:00,691 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 00:54:00,694 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2022-01-10 00:54:00,694 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075266433] [2022-01-10 00:54:00,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 00:54:00,700 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 00:54:00,700 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:54:00,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 00:54:00,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-01-10 00:54:00,700 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-10 00:54:00,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:54:00,769 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2022-01-10 00:54:00,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 00:54:00,770 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 36 [2022-01-10 00:54:00,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:54:00,771 INFO L225 Difference]: With dead ends: 56 [2022-01-10 00:54:00,772 INFO L226 Difference]: Without dead ends: 47 [2022-01-10 00:54:00,772 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-01-10 00:54:00,776 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 84 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 00:54:00,776 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 97 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 00:54:00,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-01-10 00:54:00,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 38. [2022-01-10 00:54:00,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 00:54:00,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2022-01-10 00:54:00,791 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 36 [2022-01-10 00:54:00,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:54:00,792 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2022-01-10 00:54:00,792 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-10 00:54:00,792 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-01-10 00:54:00,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-10 00:54:00,794 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:54:00,794 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:54:00,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-10 00:54:01,007 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:54:01,008 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:54:01,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:54:01,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1233857887, now seen corresponding path program 2 times [2022-01-10 00:54:01,008 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:54:01,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935629928] [2022-01-10 00:54:01,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:54:01,009 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:54:01,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:54:01,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 00:54:01,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:54:01,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 00:54:01,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:54:01,118 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-10 00:54:01,118 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:54:01,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935629928] [2022-01-10 00:54:01,118 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935629928] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:54:01,119 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:54:01,119 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 00:54:01,119 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265935767] [2022-01-10 00:54:01,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:54:01,120 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 00:54:01,120 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:54:01,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 00:54:01,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-10 00:54:01,120 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-10 00:54:01,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:54:01,194 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2022-01-10 00:54:01,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 00:54:01,195 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 41 [2022-01-10 00:54:01,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:54:01,196 INFO L225 Difference]: With dead ends: 55 [2022-01-10 00:54:01,196 INFO L226 Difference]: Without dead ends: 47 [2022-01-10 00:54:01,196 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-01-10 00:54:01,197 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 32 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 00:54:01,197 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 98 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 00:54:01,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-01-10 00:54:01,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2022-01-10 00:54:01,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 00:54:01,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2022-01-10 00:54:01,203 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 41 [2022-01-10 00:54:01,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:54:01,203 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2022-01-10 00:54:01,203 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-10 00:54:01,203 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-01-10 00:54:01,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-10 00:54:01,204 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:54:01,204 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:54:01,204 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 00:54:01,204 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:54:01,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:54:01,204 INFO L85 PathProgramCache]: Analyzing trace with hash -353457273, now seen corresponding path program 1 times [2022-01-10 00:54:01,205 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:54:01,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830471030] [2022-01-10 00:54:01,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:54:01,205 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:54:01,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:54:01,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 00:54:02,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:54:02,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 00:54:02,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:54:02,123 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 00:54:02,124 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:54:02,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830471030] [2022-01-10 00:54:02,124 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830471030] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:54:02,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987004381] [2022-01-10 00:54:02,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:54:02,124 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:54:02,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:54:02,126 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-10 00:54:02,161 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-10 00:54:02,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:54:02,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 107 conjunts are in the unsatisfiable core [2022-01-10 00:54:02,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:54:02,366 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-10 00:54:02,584 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 00:54:02,584 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 11 treesize of output 11 [2022-01-10 00:54:02,641 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 00:54:02,699 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 00:54:02,699 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-01-10 00:54:02,834 INFO L353 Elim1Store]: treesize reduction 34, result has 24.4 percent of original size [2022-01-10 00:54:02,834 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 69 [2022-01-10 00:54:02,843 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 13 [2022-01-10 00:54:02,848 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2022-01-10 00:54:02,853 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-01-10 00:54:02,864 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 27 treesize of output 19 [2022-01-10 00:54:02,867 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 9 treesize of output 7 [2022-01-10 00:54:03,118 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 00:54:03,118 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 55 [2022-01-10 00:54:03,124 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2022-01-10 00:54:03,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:54:03,128 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-01-10 00:54:03,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:54:03,315 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 38 [2022-01-10 00:54:03,322 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-01-10 00:54:03,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:54:03,329 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2022-01-10 00:54:03,557 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2022-01-10 00:54:03,565 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2022-01-10 00:54:03,644 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2022-01-10 00:54:03,772 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 00:54:03,772 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:54:04,086 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_746 (Array Int Int)) (v_ArrVal_748 Int) (v_ArrVal_747 Int)) (<= (* |c_ULTIMATE.start_main_~len~0#1| 2) (+ (let ((.cse0 (+ 16 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_746) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse0 v_ArrVal_748)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ 16 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse0 v_ArrVal_747)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) 1))) (forall ((v_ArrVal_746 (Array Int Int)) (v_ArrVal_748 Int) (v_ArrVal_747 Int)) (<= (+ (let ((.cse1 (+ 16 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_746) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse1 v_ArrVal_748)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ 16 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse1 v_ArrVal_747)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) 1) (* |c_ULTIMATE.start_main_~len~0#1| 2)))) is different from false [2022-01-10 00:54:04,141 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| Int)) (or (and (forall ((v_ArrVal_746 (Array Int Int)) (v_ArrVal_748 Int) (v_ArrVal_747 Int)) (<= (* |c_ULTIMATE.start_main_~len~0#1| 2) (+ (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 16))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_746) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_748) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_747) |c_ULTIMATE.start_main_~s~0#1.offset|) 16))) 1))) (forall ((v_ArrVal_746 (Array Int Int)) (v_ArrVal_748 Int) (v_ArrVal_747 Int)) (<= (+ (let ((.cse1 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 16))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_746) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1 v_ArrVal_748) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1 v_ArrVal_747) |c_ULTIMATE.start_main_~s~0#1.offset|) 16))) 1) (* |c_ULTIMATE.start_main_~len~0#1| 2)))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2022-01-10 00:54:04,219 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:54:04,220 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 92 [2022-01-10 00:54:04,245 INFO L353 Elim1Store]: treesize reduction 102, result has 28.2 percent of original size [2022-01-10 00:54:04,246 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 200 treesize of output 173 [2022-01-10 00:54:04,254 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 129 treesize of output 113 [2022-01-10 00:54:04,259 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 113 treesize of output 97 [2022-01-10 00:54:04,400 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| Int)) (or (let ((.cse1 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse0 (+ |c_ULTIMATE.start_dll_circular_update_at_~data#1| 1))) (and (<= .cse0 .cse1) (forall ((v_ArrVal_743 (Array Int Int)) (v_ArrVal_748 Int)) (= |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_743) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 16) v_ArrVal_748) |c_ULTIMATE.start_main_~s~0#1.offset|))) (<= .cse1 .cse0) (forall ((v_ArrVal_747 Int) (v_ArrVal_742 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_742) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 16) v_ArrVal_747) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|)) (forall ((v_ArrVal_743 (Array Int Int)) (v_ArrVal_748 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_743) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 16) v_ArrVal_748) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2022-01-10 00:54:04,535 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| Int)) (or (let ((.cse1 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse0 (+ |c_ULTIMATE.start_dll_circular_update_at_~data#1| 1))) (and (forall ((v_ArrVal_747 Int) (v_ArrVal_742 (Array Int Int))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_742) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 16) v_ArrVal_747) |c_ULTIMATE.start_main_~s~0#1.offset|))) (<= .cse0 .cse1) (<= .cse1 .cse0) (forall ((v_ArrVal_743 (Array Int Int)) (v_ArrVal_748 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (= .cse2 (select (store (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_743) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 16) v_ArrVal_748) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_ArrVal_743 (Array Int Int)) (v_ArrVal_748 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_743) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 16) v_ArrVal_748) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2022-01-10 00:54:04,611 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| Int)) (or (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|) (forall ((v_ArrVal_743 (Array Int Int)) (v_ArrVal_748 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_743) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 16) v_ArrVal_748) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_ArrVal_743 (Array Int Int)) (v_ArrVal_748 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_743) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 16) v_ArrVal_748) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse1))) (<= |c_ULTIMATE.start_main_~len~0#1| .cse0) (forall ((v_ArrVal_747 Int) (v_ArrVal_742 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_742) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 16) v_ArrVal_747) |c_ULTIMATE.start_main_~s~0#1.offset|) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2022-01-10 00:54:04,656 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| Int)) (or (and (forall ((v_ArrVal_743 (Array Int Int)) (v_ArrVal_748 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) v_ArrVal_743) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 16) v_ArrVal_748) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (forall ((v_ArrVal_743 (Array Int Int)) (v_ArrVal_748 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_743) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 16) v_ArrVal_748) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) .cse0))) (forall ((v_ArrVal_747 Int) (v_ArrVal_742 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) v_ArrVal_742) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 16) v_ArrVal_747) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) is different from false [2022-01-10 00:54:04,684 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 00:54:04,689 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 145 treesize of output 143 [2022-01-10 00:54:04,696 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 00:54:04,698 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 122 treesize of output 120 [2022-01-10 00:54:04,742 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (and (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_740 Int) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_prenex_10 Int)) (let ((.cse1 (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_737) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_740))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (= .cse0 (select (store (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_736) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse1) .cse0 v_prenex_9) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 16) v_prenex_10) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) (forall ((v_ArrVal_740 Int) (v_ArrVal_737 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_737) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_740) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (forall ((v_ArrVal_743 (Array Int Int)) (v_ArrVal_740 Int) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_748 Int)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select (let ((.cse2 (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_737) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_740))) (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_736) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse2) (select .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_743)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 16) v_ArrVal_748) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))))) is different from false [2022-01-10 00:54:04,814 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| Int)) (or (and (forall ((v_ArrVal_740 Int) (v_ArrVal_737 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_737) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 8) v_ArrVal_740) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_740 Int) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_prenex_10 Int)) (let ((.cse1 (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_737) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 8) v_ArrVal_740))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= .cse0 (select (store (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_736) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse1) .cse0 v_prenex_9) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 16) v_prenex_10) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) (forall ((v_ArrVal_743 (Array Int Int)) (v_ArrVal_740 Int) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_748 Int)) (not (= (select (store (select (let ((.cse2 (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_737) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 8) v_ArrVal_740))) (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_736) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse2) (select .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_743)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 16) v_ArrVal_748) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) is different from false [2022-01-10 00:54:04,874 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| Int)) (or (and (forall ((v_ArrVal_743 (Array Int Int)) (v_ArrVal_740 Int) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_748 Int)) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_734))) (let ((.cse1 (store (select (store .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_737) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 8) v_ArrVal_740))) (store (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_736) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse1) (select .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_743))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 16) v_ArrVal_748) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (forall ((v_ArrVal_740 Int) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_737 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_737) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 8) v_ArrVal_740) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (forall ((v_prenex_9 (Array Int Int)) (v_ArrVal_740 Int) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_prenex_10 Int)) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_734))) (let ((.cse3 (store (select (store .cse2 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_737) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 8) v_ArrVal_740))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= (select (store (select (store (store (store .cse2 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_736) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse3) .cse4 v_prenex_9) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 16) v_prenex_10) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) .cse4)))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) is different from false [2022-01-10 00:54:04,896 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:54:04,896 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 204 treesize of output 149 [2022-01-10 00:54:04,920 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1483 treesize of output 1445 [2022-01-10 00:54:04,946 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 00:54:04,947 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 00:54:04,952 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 1319 treesize of output 1289 [2022-01-10 00:54:05,008 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 00:54:05,011 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 1116 treesize of output 1100 [2022-01-10 00:54:05,019 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 00:54:05,021 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 00:54:05,023 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 1060 treesize of output 1048 [2022-01-10 00:54:05,031 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 00:54:05,032 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 00:54:05,034 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 968 treesize of output 944 [2022-01-10 00:54:05,050 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 00:54:05,052 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 00:54:05,054 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 707 treesize of output 695 [2022-01-10 00:54:05,074 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 00:54:05,076 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 00:54:05,078 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 494 treesize of output 470 [2022-01-10 00:54:05,090 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 00:54:05,092 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 389 treesize of output 387 [2022-01-10 00:54:05,117 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-10 00:54:05,734 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-01-10 00:54:05,734 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987004381] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 00:54:05,734 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 00:54:05,734 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24, 25] total 67 [2022-01-10 00:54:05,734 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344583744] [2022-01-10 00:54:05,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 00:54:05,735 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-01-10 00:54:05,735 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:54:05,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-01-10 00:54:05,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=3146, Unknown=9, NotChecked=1080, Total=4422 [2022-01-10 00:54:05,737 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand has 67 states, 67 states have (on average 1.507462686567164) internal successors, (101), 58 states have internal predecessors, (101), 4 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-01-10 00:54:08,491 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| Int)) (or (and (forall ((v_ArrVal_743 (Array Int Int)) (v_ArrVal_748 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) v_ArrVal_743) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 16) v_ArrVal_748) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (forall ((v_ArrVal_743 (Array Int Int)) (v_ArrVal_748 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_743) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 16) v_ArrVal_748) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) .cse1))) (forall ((v_ArrVal_747 Int) (v_ArrVal_742 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) v_ArrVal_742) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 16) v_ArrVal_747) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) 0))) is different from false [2022-01-10 00:54:10,525 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| Int)) (or (let ((.cse1 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= .cse1 |c_ULTIMATE.start_main_~len~0#1|) (forall ((v_ArrVal_743 (Array Int Int)) (v_ArrVal_748 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_743) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 16) v_ArrVal_748) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_ArrVal_743 (Array Int Int)) (v_ArrVal_748 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_743) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 16) v_ArrVal_748) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse2))) (<= |c_ULTIMATE.start_main_~len~0#1| .cse1) (forall ((v_ArrVal_747 Int) (v_ArrVal_742 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_742) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 16) v_ArrVal_747) |c_ULTIMATE.start_main_~s~0#1.offset|) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| |c_ULTIMATE.start_main_~s~0#1.offset|))) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 0) (<= |c_ULTIMATE.start_main_~len~0#1| .cse0) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2022-01-10 00:54:11,060 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|)) (.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (and (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|) (= .cse1 0) (= .cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|)) (= |c_ULTIMATE.start_dll_circular_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| |c_ULTIMATE.start_main_~i~0#1|)) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_update_at_~data#1| (+ (- 1) (* |c_ULTIMATE.start_main_~len~0#1| 2))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| Int)) (or (let ((.cse3 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse2 (+ |c_ULTIMATE.start_dll_circular_update_at_~data#1| 1))) (and (forall ((v_ArrVal_747 Int) (v_ArrVal_742 (Array Int Int))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_742) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 16) v_ArrVal_747) |c_ULTIMATE.start_main_~s~0#1.offset|))) (<= .cse2 .cse3) (<= .cse3 .cse2) (forall ((v_ArrVal_743 (Array Int Int)) (v_ArrVal_748 Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (= .cse4 (select (store (select (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_743) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 16) v_ArrVal_748) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_ArrVal_743 (Array Int Int)) (v_ArrVal_748 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_743) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 16) v_ArrVal_748) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| |c_ULTIMATE.start_main_~s~0#1.offset|))) (= (select .cse5 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) .cse6) (= |c_ULTIMATE.start_main_~s~0#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) (not (= (select .cse5 0) |c_ULTIMATE.start_main_~s~0#1.base|)) (<= |c_ULTIMATE.start_main_~len~0#1| .cse0) (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse6)) (= |c_ULTIMATE.start_main_~s~0#1.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) is different from false [2022-01-10 00:54:11,660 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|) (= |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) (= |c_ULTIMATE.start_dll_circular_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| |c_ULTIMATE.start_main_~i~0#1|)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|)) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 0) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| Int)) (or (let ((.cse2 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_update_at_~data#1| 1))) (and (<= .cse1 .cse2) (forall ((v_ArrVal_743 (Array Int Int)) (v_ArrVal_748 Int)) (= |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_743) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 16) v_ArrVal_748) |c_ULTIMATE.start_main_~s~0#1.offset|))) (<= .cse2 .cse1) (forall ((v_ArrVal_747 Int) (v_ArrVal_742 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_742) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 16) v_ArrVal_747) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|)) (forall ((v_ArrVal_743 (Array Int Int)) (v_ArrVal_748 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_743) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 16) v_ArrVal_748) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| |c_ULTIMATE.start_main_~s~0#1.offset|))) (<= |c_ULTIMATE.start_main_~len~0#1| .cse0))) is different from false [2022-01-10 00:54:11,669 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (and (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| Int)) (or (and (forall ((v_ArrVal_746 (Array Int Int)) (v_ArrVal_748 Int) (v_ArrVal_747 Int)) (<= (* |c_ULTIMATE.start_main_~len~0#1| 2) (+ (let ((.cse1 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 16))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_746) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1 v_ArrVal_748) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1 v_ArrVal_747) |c_ULTIMATE.start_main_~s~0#1.offset|) 16))) 1))) (forall ((v_ArrVal_746 (Array Int Int)) (v_ArrVal_748 Int) (v_ArrVal_747 Int)) (<= (+ (let ((.cse2 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 16))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_746) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse2 v_ArrVal_748) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse2 v_ArrVal_747) |c_ULTIMATE.start_main_~s~0#1.offset|) 16))) 1) (* |c_ULTIMATE.start_main_~len~0#1| 2)))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| |c_ULTIMATE.start_main_~s~0#1.offset|))) (= (select (select |c_#memory_int| .cse3) 16) (+ |c_ULTIMATE.start_main_~len~0#1| |c_ULTIMATE.start_main_~i~0#1|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 0) (<= |c_ULTIMATE.start_main_~len~0#1| .cse0) (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse3)))) is different from false [2022-01-10 00:54:11,674 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse1 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse0 (+ (select (select |c_#memory_int| .cse4) 16) 1))) (and (<= .cse0 .cse1) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| Int)) (or (and (forall ((v_ArrVal_746 (Array Int Int)) (v_ArrVal_748 Int) (v_ArrVal_747 Int)) (<= (* |c_ULTIMATE.start_main_~len~0#1| 2) (+ (let ((.cse2 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 16))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_746) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse2 v_ArrVal_748) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse2 v_ArrVal_747) |c_ULTIMATE.start_main_~s~0#1.offset|) 16))) 1))) (forall ((v_ArrVal_746 (Array Int Int)) (v_ArrVal_748 Int) (v_ArrVal_747 Int)) (<= (+ (let ((.cse3 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| 16))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_746) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse3 v_ArrVal_748) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse3 v_ArrVal_747) |c_ULTIMATE.start_main_~s~0#1.offset|) 16))) 1) (* |c_ULTIMATE.start_main_~len~0#1| 2)))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_9| |c_ULTIMATE.start_main_~s~0#1.offset|))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse4)) (<= .cse1 .cse0)))) is different from false [2022-01-10 00:54:12,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:54:12,565 INFO L93 Difference]: Finished difference Result 88 states and 106 transitions. [2022-01-10 00:54:12,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-01-10 00:54:12,565 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 1.507462686567164) internal successors, (101), 58 states have internal predecessors, (101), 4 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 42 [2022-01-10 00:54:12,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:54:12,568 INFO L225 Difference]: With dead ends: 88 [2022-01-10 00:54:12,568 INFO L226 Difference]: Without dead ends: 86 [2022-01-10 00:54:12,570 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 41 SyntacticMatches, 6 SemanticMatches, 85 ConstructedPredicates, 15 IntricatePredicates, 1 DeprecatedPredicates, 893 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=343, Invalid=4813, Unknown=16, NotChecked=2310, Total=7482 [2022-01-10 00:54:12,571 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 87 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 1180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 353 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 00:54:12,571 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 782 Invalid, 1180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 792 Invalid, 0 Unknown, 353 Unchecked, 0.5s Time] [2022-01-10 00:54:12,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-01-10 00:54:12,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 66. [2022-01-10 00:54:12,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 61 states have (on average 1.2131147540983607) internal successors, (74), 61 states have internal predecessors, (74), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 00:54:12,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 80 transitions. [2022-01-10 00:54:12,583 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 80 transitions. Word has length 42 [2022-01-10 00:54:12,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:54:12,583 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 80 transitions. [2022-01-10 00:54:12,583 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 1.507462686567164) internal successors, (101), 58 states have internal predecessors, (101), 4 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-01-10 00:54:12,583 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 80 transitions. [2022-01-10 00:54:12,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-10 00:54:12,584 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:54:12,584 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:54:12,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-10 00:54:12,799 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,SelfDestructingSolverStorable6 [2022-01-10 00:54:12,800 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:54:12,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:54:12,800 INFO L85 PathProgramCache]: Analyzing trace with hash -212908663, now seen corresponding path program 1 times [2022-01-10 00:54:12,800 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:54:12,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365269546] [2022-01-10 00:54:12,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:54:12,801 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:54:12,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:54:12,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 00:54:12,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:54:12,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 00:54:12,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:54:12,885 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-10 00:54:12,886 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:54:12,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365269546] [2022-01-10 00:54:12,886 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365269546] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:54:12,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453485441] [2022-01-10 00:54:12,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:54:12,886 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:54:12,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:54:12,887 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-10 00:54:12,889 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-10 00:54:13,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:54:13,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-10 00:54:13,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:54:13,113 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-10 00:54:13,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:54:13,220 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-10 00:54:13,220 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453485441] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 00:54:13,220 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 00:54:13,221 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2022-01-10 00:54:13,221 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945851043] [2022-01-10 00:54:13,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 00:54:13,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 00:54:13,221 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:54:13,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 00:54:13,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 00:54:13,222 INFO L87 Difference]: Start difference. First operand 66 states and 80 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (4), 2 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-10 00:54:13,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:54:13,274 INFO L93 Difference]: Finished difference Result 101 states and 121 transitions. [2022-01-10 00:54:13,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 00:54:13,275 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (4), 2 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 42 [2022-01-10 00:54:13,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:54:13,275 INFO L225 Difference]: With dead ends: 101 [2022-01-10 00:54:13,276 INFO L226 Difference]: Without dead ends: 66 [2022-01-10 00:54:13,276 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 81 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-01-10 00:54:13,277 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 3 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:54:13,277 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 169 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 00:54:13,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-01-10 00:54:13,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-01-10 00:54:13,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 61 states have (on average 1.1967213114754098) internal successors, (73), 61 states have internal predecessors, (73), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 00:54:13,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 79 transitions. [2022-01-10 00:54:13,287 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 79 transitions. Word has length 42 [2022-01-10 00:54:13,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:54:13,288 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 79 transitions. [2022-01-10 00:54:13,288 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (4), 2 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-10 00:54:13,288 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2022-01-10 00:54:13,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-01-10 00:54:13,289 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:54:13,289 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:54:13,318 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-10 00:54:13,499 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:54:13,500 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:54:13,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:54:13,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1979380319, now seen corresponding path program 2 times [2022-01-10 00:54:13,500 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:54:13,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419810775] [2022-01-10 00:54:13,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:54:13,501 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:54:13,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:54:13,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 00:54:13,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:54:13,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 00:54:13,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:54:13,602 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-10 00:54:13,602 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:54:13,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419810775] [2022-01-10 00:54:13,602 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419810775] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:54:13,602 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:54:13,602 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 00:54:13,602 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392050808] [2022-01-10 00:54:13,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:54:13,603 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 00:54:13,603 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:54:13,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 00:54:13,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-10 00:54:13,604 INFO L87 Difference]: Start difference. First operand 66 states and 79 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-10 00:54:13,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:54:13,665 INFO L93 Difference]: Finished difference Result 75 states and 90 transitions. [2022-01-10 00:54:13,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 00:54:13,665 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2022-01-10 00:54:13,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:54:13,666 INFO L225 Difference]: With dead ends: 75 [2022-01-10 00:54:13,666 INFO L226 Difference]: Without dead ends: 67 [2022-01-10 00:54:13,667 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-01-10 00:54:13,667 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 36 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:54:13,667 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 77 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 00:54:13,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-01-10 00:54:13,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-01-10 00:54:13,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.1774193548387097) internal successors, (73), 62 states have internal predecessors, (73), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 00:54:13,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2022-01-10 00:54:13,680 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 43 [2022-01-10 00:54:13,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:54:13,680 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2022-01-10 00:54:13,680 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-10 00:54:13,681 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2022-01-10 00:54:13,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-01-10 00:54:13,681 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:54:13,681 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:54:13,682 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 00:54:13,682 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:54:13,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:54:13,682 INFO L85 PathProgramCache]: Analyzing trace with hash 497262156, now seen corresponding path program 3 times [2022-01-10 00:54:13,682 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:54:13,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214471485] [2022-01-10 00:54:13,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:54:13,683 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:54:13,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:54:13,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 00:54:13,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:54:13,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 00:54:13,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:54:13,778 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-10 00:54:13,779 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:54:13,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214471485] [2022-01-10 00:54:13,779 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214471485] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:54:13,779 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:54:13,779 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 00:54:13,779 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579468064] [2022-01-10 00:54:13,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:54:13,779 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 00:54:13,780 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:54:13,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 00:54:13,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 00:54:13,780 INFO L87 Difference]: Start difference. First operand 67 states and 79 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-10 00:54:13,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:54:13,840 INFO L93 Difference]: Finished difference Result 91 states and 106 transitions. [2022-01-10 00:54:13,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 00:54:13,840 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2022-01-10 00:54:13,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:54:13,842 INFO L225 Difference]: With dead ends: 91 [2022-01-10 00:54:13,842 INFO L226 Difference]: Without dead ends: 74 [2022-01-10 00:54:13,842 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 00:54:13,843 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 29 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:54:13,844 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 107 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 00:54:13,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-01-10 00:54:13,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 67. [2022-01-10 00:54:13,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.1451612903225807) internal successors, (71), 62 states have internal predecessors, (71), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 00:54:13,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 77 transitions. [2022-01-10 00:54:13,858 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 77 transitions. Word has length 43 [2022-01-10 00:54:13,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:54:13,858 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 77 transitions. [2022-01-10 00:54:13,859 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-10 00:54:13,859 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 77 transitions. [2022-01-10 00:54:13,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-01-10 00:54:13,862 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:54:13,862 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:54:13,862 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 00:54:13,862 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:54:13,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:54:13,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1076128498, now seen corresponding path program 4 times [2022-01-10 00:54:13,863 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:54:13,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945975935] [2022-01-10 00:54:13,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:54:13,863 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:54:13,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:54:13,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 00:54:13,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:54:13,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 00:54:13,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:54:13,987 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-10 00:54:13,987 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:54:13,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945975935] [2022-01-10 00:54:13,988 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945975935] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:54:13,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334006924] [2022-01-10 00:54:13,988 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-10 00:54:13,988 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:54:13,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:54:13,989 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-10 00:54:13,997 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-10 00:54:14,148 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-10 00:54:14,148 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 00:54:14,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 00:54:14,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:54:14,236 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-10 00:54:14,237 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 00:54:14,237 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334006924] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:54:14,237 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 00:54:14,237 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2022-01-10 00:54:14,237 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818344553] [2022-01-10 00:54:14,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:54:14,238 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 00:54:14,238 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:54:14,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 00:54:14,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-01-10 00:54:14,238 INFO L87 Difference]: Start difference. First operand 67 states and 77 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-10 00:54:14,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:54:14,297 INFO L93 Difference]: Finished difference Result 89 states and 102 transitions. [2022-01-10 00:54:14,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 00:54:14,298 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2022-01-10 00:54:14,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:54:14,298 INFO L225 Difference]: With dead ends: 89 [2022-01-10 00:54:14,299 INFO L226 Difference]: Without dead ends: 67 [2022-01-10 00:54:14,299 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2022-01-10 00:54:14,299 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 42 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:54:14,300 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 87 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 00:54:14,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-01-10 00:54:14,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-01-10 00:54:14,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.1129032258064515) internal successors, (69), 62 states have internal predecessors, (69), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 00:54:14,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 75 transitions. [2022-01-10 00:54:14,309 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 75 transitions. Word has length 43 [2022-01-10 00:54:14,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:54:14,310 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 75 transitions. [2022-01-10 00:54:14,310 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-10 00:54:14,310 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2022-01-10 00:54:14,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-01-10 00:54:14,310 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:54:14,311 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:54:14,337 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-10 00:54:14,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:54:14,523 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:54:14,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:54:14,524 INFO L85 PathProgramCache]: Analyzing trace with hash 315770834, now seen corresponding path program 1 times [2022-01-10 00:54:14,524 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:54:14,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544732013] [2022-01-10 00:54:14,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:54:14,524 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:54:14,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:54:14,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 00:54:14,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:54:14,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 00:54:14,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:54:14,889 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 00:54:14,889 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:54:14,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544732013] [2022-01-10 00:54:14,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544732013] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:54:14,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96736366] [2022-01-10 00:54:14,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:54:14,890 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:54:14,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:54:14,891 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-10 00:54:14,892 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-10 00:54:15,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:54:15,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 55 conjunts are in the unsatisfiable core [2022-01-10 00:54:15,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:54:15,234 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-01-10 00:54:15,411 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-01-10 00:54:15,458 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-10 00:54:15,459 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:54:15,642 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2022-01-10 00:54:15,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:54:15,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:54:15,794 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-10 00:54:15,795 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96736366] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 00:54:15,795 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 00:54:15,795 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 12, 11] total 36 [2022-01-10 00:54:15,795 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858074143] [2022-01-10 00:54:15,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 00:54:15,795 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-01-10 00:54:15,796 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:54:15,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-01-10 00:54:15,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1132, Unknown=0, NotChecked=0, Total=1260 [2022-01-10 00:54:15,797 INFO L87 Difference]: Start difference. First operand 67 states and 75 transitions. Second operand has 36 states, 36 states have (on average 3.0) internal successors, (108), 34 states have internal predecessors, (108), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 00:54:16,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:54:16,652 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2022-01-10 00:54:16,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-10 00:54:16,653 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 3.0) internal successors, (108), 34 states have internal predecessors, (108), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 48 [2022-01-10 00:54:16,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:54:16,654 INFO L225 Difference]: With dead ends: 86 [2022-01-10 00:54:16,654 INFO L226 Difference]: Without dead ends: 84 [2022-01-10 00:54:16,655 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 77 SyntacticMatches, 7 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 642 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=377, Invalid=2073, Unknown=0, NotChecked=0, Total=2450 [2022-01-10 00:54:16,655 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 233 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 00:54:16,655 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [233 Valid, 395 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 00:54:16,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-01-10 00:54:16,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 67. [2022-01-10 00:54:16,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.1129032258064515) internal successors, (69), 62 states have internal predecessors, (69), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 00:54:16,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 75 transitions. [2022-01-10 00:54:16,666 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 75 transitions. Word has length 48 [2022-01-10 00:54:16,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:54:16,666 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 75 transitions. [2022-01-10 00:54:16,666 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 3.0) internal successors, (108), 34 states have internal predecessors, (108), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 00:54:16,667 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2022-01-10 00:54:16,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-01-10 00:54:16,667 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:54:16,667 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:54:16,693 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-10 00:54:16,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-01-10 00:54:16,888 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:54:16,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:54:16,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1250615156, now seen corresponding path program 2 times [2022-01-10 00:54:16,888 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:54:16,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765248656] [2022-01-10 00:54:16,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:54:16,888 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:54:16,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:54:16,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 00:54:16,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:54:16,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 00:54:16,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:54:16,989 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-10 00:54:16,989 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:54:16,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765248656] [2022-01-10 00:54:16,989 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765248656] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:54:16,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807545467] [2022-01-10 00:54:16,990 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 00:54:16,990 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:54:16,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:54:16,991 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-10 00:54:16,992 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-10 00:54:17,237 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 00:54:17,237 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 00:54:17,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 00:54:17,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:54:17,334 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-10 00:54:17,334 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:54:17,406 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-10 00:54:17,406 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807545467] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 00:54:17,406 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 00:54:17,406 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2022-01-10 00:54:17,407 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480538675] [2022-01-10 00:54:17,407 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 00:54:17,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 00:54:17,407 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:54:17,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 00:54:17,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-01-10 00:54:17,408 INFO L87 Difference]: Start difference. First operand 67 states and 75 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-10 00:54:17,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:54:17,471 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2022-01-10 00:54:17,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 00:54:17,471 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 49 [2022-01-10 00:54:17,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:54:17,471 INFO L225 Difference]: With dead ends: 83 [2022-01-10 00:54:17,471 INFO L226 Difference]: Without dead ends: 43 [2022-01-10 00:54:17,472 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-01-10 00:54:17,472 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 31 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:54:17,472 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 137 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 00:54:17,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-01-10 00:54:17,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-01-10 00:54:17,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 00:54:17,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2022-01-10 00:54:17,477 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 49 [2022-01-10 00:54:17,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:54:17,478 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2022-01-10 00:54:17,478 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-10 00:54:17,478 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-01-10 00:54:17,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-10 00:54:17,478 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:54:17,478 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:54:17,497 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-10 00:54:17,687 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:54:17,687 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:54:17,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:54:17,688 INFO L85 PathProgramCache]: Analyzing trace with hash -744940389, now seen corresponding path program 5 times [2022-01-10 00:54:17,688 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:54:17,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649847145] [2022-01-10 00:54:17,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:54:17,688 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:54:17,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:54:17,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 00:54:17,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:54:17,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 00:54:17,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:54:17,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-10 00:54:17,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:54:17,748 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-01-10 00:54:17,748 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:54:17,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649847145] [2022-01-10 00:54:17,749 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649847145] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:54:17,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111277786] [2022-01-10 00:54:17,749 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-10 00:54:17,749 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:54:17,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:54:17,750 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-10 00:54:17,780 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-10 00:54:18,037 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-01-10 00:54:18,037 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 00:54:18,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 00:54:18,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:54:18,131 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-10 00:54:18,131 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 00:54:18,132 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111277786] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:54:18,132 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 00:54:18,132 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-01-10 00:54:18,132 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278531413] [2022-01-10 00:54:18,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:54:18,132 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 00:54:18,132 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:54:18,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 00:54:18,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 00:54:18,133 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-10 00:54:18,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:54:18,140 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2022-01-10 00:54:18,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 00:54:18,141 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 52 [2022-01-10 00:54:18,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:54:18,141 INFO L225 Difference]: With dead ends: 48 [2022-01-10 00:54:18,141 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 00:54:18,141 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 00:54:18,142 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:54:18,142 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 00:54:18,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 00:54:18,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 00:54:18,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:54:18,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 00:54:18,143 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2022-01-10 00:54:18,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:54:18,143 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 00:54:18,143 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-10 00:54:18,143 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 00:54:18,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 00:54:18,145 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 00:54:18,173 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-10 00:54:18,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:54:18,361 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.