./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-62.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-62.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 06cf0f0e06098dbd1136039511f326932a550d3a95d6c25d31884324ad030bdc --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 13:48:04,760 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 13:48:04,841 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 13:48:04,845 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 13:48:04,845 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 13:48:04,864 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 13:48:04,865 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 13:48:04,865 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 13:48:04,866 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 13:48:04,866 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 13:48:04,866 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 13:48:04,867 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 13:48:04,867 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 13:48:04,868 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 13:48:04,868 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 13:48:04,868 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 13:48:04,869 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 13:48:04,869 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 13:48:04,869 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 13:48:04,870 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 13:48:04,870 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 13:48:04,872 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 13:48:04,873 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 13:48:04,873 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 13:48:04,877 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 13:48:04,877 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 13:48:04,878 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 13:48:04,878 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 13:48:04,878 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 13:48:04,878 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 13:48:04,879 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 13:48:04,879 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 13:48:04,879 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 13:48:04,880 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 13:48:04,880 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 13:48:04,880 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 13:48:04,880 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 13:48:04,880 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 13:48:04,881 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 13:48:04,881 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 13:48:04,881 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 13:48:04,882 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 13:48:04,882 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 06cf0f0e06098dbd1136039511f326932a550d3a95d6c25d31884324ad030bdc [2024-10-14 13:48:05,156 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 13:48:05,181 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 13:48:05,184 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 13:48:05,187 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 13:48:05,188 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 13:48:05,189 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-62.i [2024-10-14 13:48:06,713 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 13:48:06,932 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 13:48:06,933 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-62.i [2024-10-14 13:48:06,944 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4422d76a0/79596df0afca430795313d756d0f0e42/FLAG8b998e951 [2024-10-14 13:48:06,963 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4422d76a0/79596df0afca430795313d756d0f0e42 [2024-10-14 13:48:06,966 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 13:48:06,968 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 13:48:06,973 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 13:48:06,973 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 13:48:06,979 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 13:48:06,980 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:48:06" (1/1) ... [2024-10-14 13:48:06,981 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d165225 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:48:06, skipping insertion in model container [2024-10-14 13:48:06,981 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:48:06" (1/1) ... [2024-10-14 13:48:07,015 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 13:48:07,243 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-62.i[916,929] [2024-10-14 13:48:07,283 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 13:48:07,298 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 13:48:07,310 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-62.i[916,929] [2024-10-14 13:48:07,335 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 13:48:07,353 INFO L204 MainTranslator]: Completed translation [2024-10-14 13:48:07,354 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:48:07 WrapperNode [2024-10-14 13:48:07,354 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 13:48:07,355 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 13:48:07,355 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 13:48:07,356 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 13:48:07,362 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:48:07" (1/1) ... [2024-10-14 13:48:07,375 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:48:07" (1/1) ... [2024-10-14 13:48:07,406 INFO L138 Inliner]: procedures = 26, calls = 116, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 350 [2024-10-14 13:48:07,407 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 13:48:07,407 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 13:48:07,408 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 13:48:07,408 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 13:48:07,423 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:48:07" (1/1) ... [2024-10-14 13:48:07,424 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:48:07" (1/1) ... [2024-10-14 13:48:07,431 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:48:07" (1/1) ... [2024-10-14 13:48:07,463 INFO L175 MemorySlicer]: Split 87 memory accesses to 11 slices as follows [2, 6, 5, 10, 18, 4, 12, 11, 10, 5, 4]. 21 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 14 writes are split as follows [0, 1, 2, 1, 1, 1, 1, 4, 1, 1, 1]. [2024-10-14 13:48:07,463 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:48:07" (1/1) ... [2024-10-14 13:48:07,463 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:48:07" (1/1) ... [2024-10-14 13:48:07,472 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:48:07" (1/1) ... [2024-10-14 13:48:07,476 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:48:07" (1/1) ... [2024-10-14 13:48:07,479 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:48:07" (1/1) ... [2024-10-14 13:48:07,481 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:48:07" (1/1) ... [2024-10-14 13:48:07,490 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 13:48:07,491 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 13:48:07,491 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 13:48:07,491 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 13:48:07,492 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:48:07" (1/1) ... [2024-10-14 13:48:07,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 13:48:07,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:48:07,530 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 13:48:07,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 13:48:07,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 13:48:07,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 13:48:07,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 13:48:07,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-14 13:48:07,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-14 13:48:07,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-14 13:48:07,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-14 13:48:07,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-14 13:48:07,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-14 13:48:07,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-10-14 13:48:07,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-10-14 13:48:07,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-10-14 13:48:07,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 13:48:07,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 13:48:07,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-14 13:48:07,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-14 13:48:07,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-14 13:48:07,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-14 13:48:07,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-14 13:48:07,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-14 13:48:07,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-10-14 13:48:07,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-10-14 13:48:07,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-10-14 13:48:07,588 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 13:48:07,588 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 13:48:07,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 13:48:07,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 13:48:07,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-14 13:48:07,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-14 13:48:07,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-14 13:48:07,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-14 13:48:07,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-14 13:48:07,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-14 13:48:07,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-14 13:48:07,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-14 13:48:07,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-14 13:48:07,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 13:48:07,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 13:48:07,721 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 13:48:07,722 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 13:48:08,128 INFO L? ?]: Removed 71 outVars from TransFormulas that were not future-live. [2024-10-14 13:48:08,128 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 13:48:08,168 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 13:48:08,169 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 13:48:08,169 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:48:08 BoogieIcfgContainer [2024-10-14 13:48:08,169 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 13:48:08,173 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 13:48:08,173 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 13:48:08,177 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 13:48:08,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 01:48:06" (1/3) ... [2024-10-14 13:48:08,178 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b2085fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:48:08, skipping insertion in model container [2024-10-14 13:48:08,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:48:07" (2/3) ... [2024-10-14 13:48:08,178 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b2085fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:48:08, skipping insertion in model container [2024-10-14 13:48:08,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:48:08" (3/3) ... [2024-10-14 13:48:08,180 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-62.i [2024-10-14 13:48:08,194 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 13:48:08,194 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 13:48:08,248 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 13:48:08,255 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@218c2d64, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 13:48:08,255 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 13:48:08,259 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 55 states have (on average 1.4727272727272727) internal successors, (81), 56 states have internal predecessors, (81), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 13:48:08,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-14 13:48:08,273 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:48:08,274 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:48:08,275 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:48:08,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:48:08,281 INFO L85 PathProgramCache]: Analyzing trace with hash -710106841, now seen corresponding path program 1 times [2024-10-14 13:48:08,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:48:08,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353104263] [2024-10-14 13:48:08,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:48:08,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:48:08,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:08,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:48:08,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:08,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:48:08,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:08,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:48:08,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:08,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:48:08,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:08,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:48:08,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:08,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:48:08,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:08,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:48:08,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:08,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:48:08,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:08,693 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-14 13:48:08,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:48:08,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353104263] [2024-10-14 13:48:08,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353104263] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:48:08,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:48:08,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 13:48:08,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921489275] [2024-10-14 13:48:08,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:48:08,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 13:48:08,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:48:08,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 13:48:08,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 13:48:08,736 INFO L87 Difference]: Start difference. First operand has 66 states, 55 states have (on average 1.4727272727272727) internal successors, (81), 56 states have internal predecessors, (81), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 13:48:08,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:48:08,771 INFO L93 Difference]: Finished difference Result 129 states and 200 transitions. [2024-10-14 13:48:08,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 13:48:08,774 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 68 [2024-10-14 13:48:08,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:48:08,782 INFO L225 Difference]: With dead ends: 129 [2024-10-14 13:48:08,783 INFO L226 Difference]: Without dead ends: 64 [2024-10-14 13:48:08,786 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 13:48:08,792 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:48:08,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:48:08,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-14 13:48:08,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-10-14 13:48:08,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 54 states have internal predecessors, (76), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 13:48:08,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 92 transitions. [2024-10-14 13:48:08,840 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 92 transitions. Word has length 68 [2024-10-14 13:48:08,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:48:08,840 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 92 transitions. [2024-10-14 13:48:08,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 13:48:08,841 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 92 transitions. [2024-10-14 13:48:08,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-14 13:48:08,844 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:48:08,844 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:48:08,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 13:48:08,845 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:48:08,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:48:08,846 INFO L85 PathProgramCache]: Analyzing trace with hash -770566889, now seen corresponding path program 1 times [2024-10-14 13:48:08,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:48:08,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927120067] [2024-10-14 13:48:08,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:48:08,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:48:08,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:09,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:48:09,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:09,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:48:09,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:09,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:48:09,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:09,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:48:09,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:09,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:48:09,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:09,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:48:09,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:09,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:48:09,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:09,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:48:09,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:09,187 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-14 13:48:09,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:48:09,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927120067] [2024-10-14 13:48:09,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927120067] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:48:09,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:48:09,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 13:48:09,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732094674] [2024-10-14 13:48:09,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:48:09,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 13:48:09,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:48:09,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 13:48:09,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 13:48:09,194 INFO L87 Difference]: Start difference. First operand 64 states and 92 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:48:09,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:48:09,248 INFO L93 Difference]: Finished difference Result 130 states and 187 transitions. [2024-10-14 13:48:09,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 13:48:09,249 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 68 [2024-10-14 13:48:09,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:48:09,250 INFO L225 Difference]: With dead ends: 130 [2024-10-14 13:48:09,250 INFO L226 Difference]: Without dead ends: 67 [2024-10-14 13:48:09,251 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 13:48:09,252 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 1 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:48:09,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 248 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:48:09,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-14 13:48:09,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2024-10-14 13:48:09,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 56 states have internal predecessors, (78), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 13:48:09,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 94 transitions. [2024-10-14 13:48:09,261 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 94 transitions. Word has length 68 [2024-10-14 13:48:09,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:48:09,262 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 94 transitions. [2024-10-14 13:48:09,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:48:09,263 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 94 transitions. [2024-10-14 13:48:09,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-14 13:48:09,272 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:48:09,272 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:48:09,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 13:48:09,275 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:48:09,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:48:09,275 INFO L85 PathProgramCache]: Analyzing trace with hash -713308587, now seen corresponding path program 1 times [2024-10-14 13:48:09,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:48:09,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788707631] [2024-10-14 13:48:09,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:48:09,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:48:09,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:09,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:48:09,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:09,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:48:09,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:09,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:48:09,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:09,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:48:09,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:09,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:48:09,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:09,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:48:09,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:09,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:48:09,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:09,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:48:09,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:09,459 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-14 13:48:09,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:48:09,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788707631] [2024-10-14 13:48:09,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788707631] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:48:09,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:48:09,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 13:48:09,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133459224] [2024-10-14 13:48:09,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:48:09,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 13:48:09,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:48:09,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 13:48:09,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 13:48:09,464 INFO L87 Difference]: Start difference. First operand 66 states and 94 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:48:09,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:48:09,513 INFO L93 Difference]: Finished difference Result 134 states and 191 transitions. [2024-10-14 13:48:09,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 13:48:09,516 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 68 [2024-10-14 13:48:09,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:48:09,518 INFO L225 Difference]: With dead ends: 134 [2024-10-14 13:48:09,518 INFO L226 Difference]: Without dead ends: 69 [2024-10-14 13:48:09,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 13:48:09,521 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 1 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:48:09,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 252 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:48:09,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-14 13:48:09,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2024-10-14 13:48:09,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 58 states have (on average 1.3793103448275863) internal successors, (80), 58 states have internal predecessors, (80), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 13:48:09,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 96 transitions. [2024-10-14 13:48:09,536 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 96 transitions. Word has length 68 [2024-10-14 13:48:09,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:48:09,537 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 96 transitions. [2024-10-14 13:48:09,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:48:09,537 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 96 transitions. [2024-10-14 13:48:09,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-14 13:48:09,539 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:48:09,539 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:48:09,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 13:48:09,540 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:48:09,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:48:09,540 INFO L85 PathProgramCache]: Analyzing trace with hash -713249005, now seen corresponding path program 1 times [2024-10-14 13:48:09,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:48:09,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477035351] [2024-10-14 13:48:09,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:48:09,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:48:09,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:09,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:48:09,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:09,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:48:09,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:09,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:48:09,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:09,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:48:09,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:09,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:48:09,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:09,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:48:09,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:09,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:48:09,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:09,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:48:09,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:09,842 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-14 13:48:09,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:48:09,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477035351] [2024-10-14 13:48:09,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477035351] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:48:09,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:48:09,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 13:48:09,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597813647] [2024-10-14 13:48:09,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:48:09,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 13:48:09,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:48:09,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 13:48:09,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 13:48:09,849 INFO L87 Difference]: Start difference. First operand 68 states and 96 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:48:09,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:48:09,921 INFO L93 Difference]: Finished difference Result 160 states and 226 transitions. [2024-10-14 13:48:09,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 13:48:09,922 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 68 [2024-10-14 13:48:09,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:48:09,923 INFO L225 Difference]: With dead ends: 160 [2024-10-14 13:48:09,923 INFO L226 Difference]: Without dead ends: 93 [2024-10-14 13:48:09,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:48:09,925 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 86 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:48:09,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 260 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:48:09,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-14 13:48:09,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 68. [2024-10-14 13:48:09,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 58 states have (on average 1.3620689655172413) internal successors, (79), 58 states have internal predecessors, (79), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 13:48:09,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 95 transitions. [2024-10-14 13:48:09,944 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 95 transitions. Word has length 68 [2024-10-14 13:48:09,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:48:09,946 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 95 transitions. [2024-10-14 13:48:09,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:48:09,947 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 95 transitions. [2024-10-14 13:48:09,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-14 13:48:09,948 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:48:09,948 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:48:09,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 13:48:09,949 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:48:09,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:48:09,949 INFO L85 PathProgramCache]: Analyzing trace with hash -637477704, now seen corresponding path program 1 times [2024-10-14 13:48:09,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:48:09,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119355038] [2024-10-14 13:48:09,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:48:09,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:48:09,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:10,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:48:10,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:10,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:48:10,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:10,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:48:10,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:10,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:48:10,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:10,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:48:10,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:10,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:48:10,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:10,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:48:10,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:10,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:48:10,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:10,301 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-14 13:48:10,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:48:10,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119355038] [2024-10-14 13:48:10,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119355038] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:48:10,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:48:10,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 13:48:10,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64852821] [2024-10-14 13:48:10,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:48:10,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 13:48:10,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:48:10,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 13:48:10,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:48:10,307 INFO L87 Difference]: Start difference. First operand 68 states and 95 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:48:10,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:48:10,441 INFO L93 Difference]: Finished difference Result 205 states and 287 transitions. [2024-10-14 13:48:10,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 13:48:10,442 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 70 [2024-10-14 13:48:10,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:48:10,444 INFO L225 Difference]: With dead ends: 205 [2024-10-14 13:48:10,447 INFO L226 Difference]: Without dead ends: 138 [2024-10-14 13:48:10,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-14 13:48:10,449 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 87 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:48:10,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 637 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:48:10,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-10-14 13:48:10,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 78. [2024-10-14 13:48:10,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 68 states have (on average 1.3676470588235294) internal successors, (93), 68 states have internal predecessors, (93), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 13:48:10,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 109 transitions. [2024-10-14 13:48:10,460 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 109 transitions. Word has length 70 [2024-10-14 13:48:10,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:48:10,461 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 109 transitions. [2024-10-14 13:48:10,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:48:10,461 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 109 transitions. [2024-10-14 13:48:10,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-14 13:48:10,462 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:48:10,463 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:48:10,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 13:48:10,463 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:48:10,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:48:10,464 INFO L85 PathProgramCache]: Analyzing trace with hash 2026116434, now seen corresponding path program 1 times [2024-10-14 13:48:10,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:48:10,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004584122] [2024-10-14 13:48:10,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:48:10,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:48:10,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:10,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:48:10,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:10,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:48:10,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:10,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:48:10,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:10,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:48:10,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:10,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:48:10,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:10,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:48:10,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:10,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:48:10,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:10,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:48:10,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:10,744 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-14 13:48:10,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:48:10,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004584122] [2024-10-14 13:48:10,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004584122] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:48:10,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:48:10,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:48:10,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600798191] [2024-10-14 13:48:10,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:48:10,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:48:10,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:48:10,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:48:10,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:48:10,748 INFO L87 Difference]: Start difference. First operand 78 states and 109 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:48:10,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:48:10,829 INFO L93 Difference]: Finished difference Result 188 states and 261 transitions. [2024-10-14 13:48:10,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:48:10,830 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 72 [2024-10-14 13:48:10,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:48:10,835 INFO L225 Difference]: With dead ends: 188 [2024-10-14 13:48:10,835 INFO L226 Difference]: Without dead ends: 111 [2024-10-14 13:48:10,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:48:10,836 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 47 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:48:10,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 445 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:48:10,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-14 13:48:10,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 78. [2024-10-14 13:48:10,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 68 states have (on average 1.3529411764705883) internal successors, (92), 68 states have internal predecessors, (92), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 13:48:10,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 108 transitions. [2024-10-14 13:48:10,850 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 108 transitions. Word has length 72 [2024-10-14 13:48:10,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:48:10,851 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 108 transitions. [2024-10-14 13:48:10,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:48:10,851 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 108 transitions. [2024-10-14 13:48:10,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-14 13:48:10,852 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:48:10,852 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:48:10,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 13:48:10,853 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:48:10,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:48:10,853 INFO L85 PathProgramCache]: Analyzing trace with hash -22400883, now seen corresponding path program 1 times [2024-10-14 13:48:10,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:48:10,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193169516] [2024-10-14 13:48:10,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:48:10,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:48:10,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:10,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:48:10,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:10,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:48:10,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:10,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:48:10,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:10,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:48:10,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:10,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:48:10,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:10,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:48:10,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:10,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:48:10,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:11,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:48:11,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:11,004 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-14 13:48:11,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:48:11,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193169516] [2024-10-14 13:48:11,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193169516] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:48:11,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:48:11,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:48:11,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201866332] [2024-10-14 13:48:11,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:48:11,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:48:11,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:48:11,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:48:11,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:48:11,007 INFO L87 Difference]: Start difference. First operand 78 states and 108 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:48:11,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:48:11,051 INFO L93 Difference]: Finished difference Result 158 states and 219 transitions. [2024-10-14 13:48:11,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:48:11,051 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 72 [2024-10-14 13:48:11,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:48:11,052 INFO L225 Difference]: With dead ends: 158 [2024-10-14 13:48:11,053 INFO L226 Difference]: Without dead ends: 81 [2024-10-14 13:48:11,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:48:11,054 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 0 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:48:11,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 325 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:48:11,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-14 13:48:11,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-10-14 13:48:11,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 71 states have (on average 1.3380281690140845) internal successors, (95), 71 states have internal predecessors, (95), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 13:48:11,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 111 transitions. [2024-10-14 13:48:11,060 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 111 transitions. Word has length 72 [2024-10-14 13:48:11,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:48:11,060 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 111 transitions. [2024-10-14 13:48:11,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:48:11,061 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 111 transitions. [2024-10-14 13:48:11,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-14 13:48:11,061 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:48:11,062 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:48:11,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 13:48:11,062 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:48:11,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:48:11,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1221843874, now seen corresponding path program 1 times [2024-10-14 13:48:11,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:48:11,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131437553] [2024-10-14 13:48:11,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:48:11,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:48:11,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:11,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:48:11,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:11,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:48:11,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:11,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:48:11,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:11,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:48:11,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:11,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:48:11,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:11,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:48:11,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:11,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:48:11,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:11,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:48:11,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:11,261 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-14 13:48:11,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:48:11,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131437553] [2024-10-14 13:48:11,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131437553] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:48:11,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:48:11,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:48:11,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655126904] [2024-10-14 13:48:11,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:48:11,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:48:11,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:48:11,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:48:11,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:48:11,263 INFO L87 Difference]: Start difference. First operand 81 states and 111 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:48:11,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:48:11,334 INFO L93 Difference]: Finished difference Result 192 states and 261 transitions. [2024-10-14 13:48:11,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:48:11,335 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 72 [2024-10-14 13:48:11,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:48:11,336 INFO L225 Difference]: With dead ends: 192 [2024-10-14 13:48:11,338 INFO L226 Difference]: Without dead ends: 112 [2024-10-14 13:48:11,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:48:11,339 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 42 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:48:11,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 338 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:48:11,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-14 13:48:11,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 81. [2024-10-14 13:48:11,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 71 states have (on average 1.323943661971831) internal successors, (94), 71 states have internal predecessors, (94), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 13:48:11,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 110 transitions. [2024-10-14 13:48:11,351 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 110 transitions. Word has length 72 [2024-10-14 13:48:11,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:48:11,351 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 110 transitions. [2024-10-14 13:48:11,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:48:11,352 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 110 transitions. [2024-10-14 13:48:11,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-14 13:48:11,352 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:48:11,352 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:48:11,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 13:48:11,353 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:48:11,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:48:11,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1308385672, now seen corresponding path program 1 times [2024-10-14 13:48:11,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:48:11,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571876014] [2024-10-14 13:48:11,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:48:11,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:48:11,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:11,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:48:11,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:11,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:48:11,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:11,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:48:11,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:11,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:48:11,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:11,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:48:11,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:11,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:48:11,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:11,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:48:11,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:11,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:48:11,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:11,831 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-10-14 13:48:11,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:48:11,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571876014] [2024-10-14 13:48:11,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571876014] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 13:48:11,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1978312018] [2024-10-14 13:48:11,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:48:11,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 13:48:11,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:48:11,845 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) [2024-10-14 13:48:11,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 13:48:12,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:12,018 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-14 13:48:12,028 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:48:12,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 13:48:12,426 INFO L378 Elim1Store]: Elim1 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 11 [2024-10-14 13:48:12,441 INFO L378 Elim1Store]: Elim1 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 17 treesize of output 9 [2024-10-14 13:48:12,465 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 1 proven. 51 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-14 13:48:12,466 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 13:48:12,549 INFO L378 Elim1Store]: Elim1 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 21 treesize of output 13 [2024-10-14 13:48:12,709 INFO L378 Elim1Store]: Elim1 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 32 treesize of output 28 [2024-10-14 13:48:12,784 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-10-14 13:48:12,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1978312018] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 13:48:12,784 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 13:48:12,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 22 [2024-10-14 13:48:12,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134267914] [2024-10-14 13:48:12,785 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 13:48:12,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-14 13:48:12,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:48:12,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-14 13:48:12,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2024-10-14 13:48:12,787 INFO L87 Difference]: Start difference. First operand 81 states and 110 transitions. Second operand has 22 states, 19 states have (on average 3.526315789473684) internal successors, (67), 22 states have internal predecessors, (67), 6 states have call successors, (18), 3 states have call predecessors, (18), 5 states have return successors, (18), 3 states have call predecessors, (18), 6 states have call successors, (18) [2024-10-14 13:48:13,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:48:13,610 INFO L93 Difference]: Finished difference Result 296 states and 392 transitions. [2024-10-14 13:48:13,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-14 13:48:13,611 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 3.526315789473684) internal successors, (67), 22 states have internal predecessors, (67), 6 states have call successors, (18), 3 states have call predecessors, (18), 5 states have return successors, (18), 3 states have call predecessors, (18), 6 states have call successors, (18) Word has length 74 [2024-10-14 13:48:13,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:48:13,613 INFO L225 Difference]: With dead ends: 296 [2024-10-14 13:48:13,613 INFO L226 Difference]: Without dead ends: 216 [2024-10-14 13:48:13,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=366, Invalid=1440, Unknown=0, NotChecked=0, Total=1806 [2024-10-14 13:48:13,615 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 700 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 13:48:13,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 698 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 13:48:13,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-10-14 13:48:13,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 204. [2024-10-14 13:48:13,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 183 states have (on average 1.3005464480874316) internal successors, (238), 185 states have internal predecessors, (238), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 13:48:13,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 270 transitions. [2024-10-14 13:48:13,643 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 270 transitions. Word has length 74 [2024-10-14 13:48:13,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:48:13,643 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 270 transitions. [2024-10-14 13:48:13,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 3.526315789473684) internal successors, (67), 22 states have internal predecessors, (67), 6 states have call successors, (18), 3 states have call predecessors, (18), 5 states have return successors, (18), 3 states have call predecessors, (18), 6 states have call successors, (18) [2024-10-14 13:48:13,644 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 270 transitions. [2024-10-14 13:48:13,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-14 13:48:13,645 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:48:13,645 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:48:13,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-14 13:48:13,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 13:48:13,847 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:48:13,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:48:13,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1697474561, now seen corresponding path program 1 times [2024-10-14 13:48:13,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:48:13,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932944611] [2024-10-14 13:48:13,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:48:13,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:48:13,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:14,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:48:14,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:14,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:48:14,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:14,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:48:14,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:14,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:48:14,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:14,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:48:14,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:14,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:48:14,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:14,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:48:14,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:14,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:48:14,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:14,937 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-14 13:48:14,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:48:14,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932944611] [2024-10-14 13:48:14,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932944611] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:48:14,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:48:14,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-14 13:48:14,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226461188] [2024-10-14 13:48:14,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:48:14,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-14 13:48:14,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:48:14,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-14 13:48:14,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-10-14 13:48:14,939 INFO L87 Difference]: Start difference. First operand 204 states and 270 transitions. Second operand has 15 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-14 13:48:15,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:48:15,890 INFO L93 Difference]: Finished difference Result 422 states and 555 transitions. [2024-10-14 13:48:15,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 13:48:15,890 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 75 [2024-10-14 13:48:15,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:48:15,894 INFO L225 Difference]: With dead ends: 422 [2024-10-14 13:48:15,894 INFO L226 Difference]: Without dead ends: 219 [2024-10-14 13:48:15,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=120, Invalid=530, Unknown=0, NotChecked=0, Total=650 [2024-10-14 13:48:15,896 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 313 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 939 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 13:48:15,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 939 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 13:48:15,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-10-14 13:48:15,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 208. [2024-10-14 13:48:15,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 187 states have (on average 1.2941176470588236) internal successors, (242), 189 states have internal predecessors, (242), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 13:48:15,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 274 transitions. [2024-10-14 13:48:15,918 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 274 transitions. Word has length 75 [2024-10-14 13:48:15,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:48:15,919 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 274 transitions. [2024-10-14 13:48:15,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-14 13:48:15,920 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 274 transitions. [2024-10-14 13:48:15,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-14 13:48:15,921 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:48:15,921 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:48:15,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 13:48:15,922 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:48:15,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:48:15,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1586375485, now seen corresponding path program 1 times [2024-10-14 13:48:15,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:48:15,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712423248] [2024-10-14 13:48:15,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:48:15,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:48:15,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:16,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:48:16,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:16,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:48:16,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:16,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:48:16,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:16,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:48:16,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:16,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:48:16,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:16,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:48:16,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:16,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:48:16,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:16,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:48:16,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:16,076 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-14 13:48:16,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:48:16,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712423248] [2024-10-14 13:48:16,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712423248] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:48:16,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:48:16,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 13:48:16,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511610467] [2024-10-14 13:48:16,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:48:16,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 13:48:16,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:48:16,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 13:48:16,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:48:16,079 INFO L87 Difference]: Start difference. First operand 208 states and 274 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:48:16,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:48:16,201 INFO L93 Difference]: Finished difference Result 414 states and 544 transitions. [2024-10-14 13:48:16,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 13:48:16,201 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 75 [2024-10-14 13:48:16,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:48:16,203 INFO L225 Difference]: With dead ends: 414 [2024-10-14 13:48:16,203 INFO L226 Difference]: Without dead ends: 207 [2024-10-14 13:48:16,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 13:48:16,204 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 50 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:48:16,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 501 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:48:16,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-10-14 13:48:16,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 204. [2024-10-14 13:48:16,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 183 states have (on average 1.289617486338798) internal successors, (236), 185 states have internal predecessors, (236), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 13:48:16,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 268 transitions. [2024-10-14 13:48:16,222 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 268 transitions. Word has length 75 [2024-10-14 13:48:16,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:48:16,222 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 268 transitions. [2024-10-14 13:48:16,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:48:16,223 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 268 transitions. [2024-10-14 13:48:16,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-14 13:48:16,225 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:48:16,225 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:48:16,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 13:48:16,225 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:48:16,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:48:16,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1478619843, now seen corresponding path program 1 times [2024-10-14 13:48:16,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:48:16,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274606980] [2024-10-14 13:48:16,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:48:16,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:48:16,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:16,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:48:16,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:16,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:48:16,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:16,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:48:16,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:16,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:48:16,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:16,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:48:16,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:16,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:48:16,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:16,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:48:16,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:16,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:48:16,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:16,375 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-14 13:48:16,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:48:16,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274606980] [2024-10-14 13:48:16,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274606980] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:48:16,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:48:16,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 13:48:16,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273733014] [2024-10-14 13:48:16,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:48:16,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 13:48:16,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:48:16,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 13:48:16,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:48:16,379 INFO L87 Difference]: Start difference. First operand 204 states and 268 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:48:16,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:48:16,504 INFO L93 Difference]: Finished difference Result 459 states and 598 transitions. [2024-10-14 13:48:16,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 13:48:16,506 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 75 [2024-10-14 13:48:16,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:48:16,507 INFO L225 Difference]: With dead ends: 459 [2024-10-14 13:48:16,507 INFO L226 Difference]: Without dead ends: 247 [2024-10-14 13:48:16,508 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-14 13:48:16,508 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 61 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:48:16,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 513 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:48:16,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-10-14 13:48:16,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 208. [2024-10-14 13:48:16,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 186 states have (on average 1.2688172043010753) internal successors, (236), 188 states have internal predecessors, (236), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 13:48:16,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 268 transitions. [2024-10-14 13:48:16,527 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 268 transitions. Word has length 75 [2024-10-14 13:48:16,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:48:16,528 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 268 transitions. [2024-10-14 13:48:16,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:48:16,528 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 268 transitions. [2024-10-14 13:48:16,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-14 13:48:16,529 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:48:16,529 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:48:16,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 13:48:16,530 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:48:16,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:48:16,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1805230203, now seen corresponding path program 1 times [2024-10-14 13:48:16,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:48:16,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942326471] [2024-10-14 13:48:16,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:48:16,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:48:16,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:17,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:48:17,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:17,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:48:17,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:17,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:48:17,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:17,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:48:17,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:17,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:48:17,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:17,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:48:17,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:17,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:48:17,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:17,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:48:17,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:17,619 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-14 13:48:17,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:48:17,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942326471] [2024-10-14 13:48:17,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942326471] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:48:17,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:48:17,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-10-14 13:48:17,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142416861] [2024-10-14 13:48:17,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:48:17,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-14 13:48:17,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:48:17,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-14 13:48:17,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2024-10-14 13:48:17,623 INFO L87 Difference]: Start difference. First operand 208 states and 268 transitions. Second operand has 17 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-14 13:48:18,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:48:18,891 INFO L93 Difference]: Finished difference Result 848 states and 1078 transitions. [2024-10-14 13:48:18,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-14 13:48:18,893 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 75 [2024-10-14 13:48:18,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:48:18,896 INFO L225 Difference]: With dead ends: 848 [2024-10-14 13:48:18,897 INFO L226 Difference]: Without dead ends: 641 [2024-10-14 13:48:18,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=272, Invalid=1060, Unknown=0, NotChecked=0, Total=1332 [2024-10-14 13:48:18,899 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 754 mSDsluCounter, 1146 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 754 SdHoareTripleChecker+Valid, 1245 SdHoareTripleChecker+Invalid, 910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 13:48:18,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [754 Valid, 1245 Invalid, 910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 841 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 13:48:18,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2024-10-14 13:48:18,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 381. [2024-10-14 13:48:18,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 340 states have (on average 1.261764705882353) internal successors, (429), 343 states have internal predecessors, (429), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-14 13:48:18,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 489 transitions. [2024-10-14 13:48:18,932 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 489 transitions. Word has length 75 [2024-10-14 13:48:18,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:48:18,933 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 489 transitions. [2024-10-14 13:48:18,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-14 13:48:18,933 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 489 transitions. [2024-10-14 13:48:18,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-14 13:48:18,934 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:48:18,934 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:48:18,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 13:48:18,934 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:48:18,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:48:18,935 INFO L85 PathProgramCache]: Analyzing trace with hash -374470502, now seen corresponding path program 1 times [2024-10-14 13:48:18,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:48:18,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686496919] [2024-10-14 13:48:18,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:48:18,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:48:18,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:19,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:48:19,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:19,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:48:19,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:19,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:48:19,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:19,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:48:19,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:19,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:48:19,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:19,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:48:19,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:19,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:48:19,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:19,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:48:19,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:19,080 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-14 13:48:19,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:48:19,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686496919] [2024-10-14 13:48:19,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686496919] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:48:19,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:48:19,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 13:48:19,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637749249] [2024-10-14 13:48:19,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:48:19,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 13:48:19,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:48:19,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 13:48:19,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:48:19,082 INFO L87 Difference]: Start difference. First operand 381 states and 489 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:48:19,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:48:19,135 INFO L93 Difference]: Finished difference Result 781 states and 1002 transitions. [2024-10-14 13:48:19,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 13:48:19,135 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 75 [2024-10-14 13:48:19,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:48:19,138 INFO L225 Difference]: With dead ends: 781 [2024-10-14 13:48:19,138 INFO L226 Difference]: Without dead ends: 401 [2024-10-14 13:48:19,139 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:48:19,139 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 0 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:48:19,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 402 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:48:19,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2024-10-14 13:48:19,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 386. [2024-10-14 13:48:19,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 345 states have (on average 1.2579710144927536) internal successors, (434), 348 states have internal predecessors, (434), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-14 13:48:19,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 494 transitions. [2024-10-14 13:48:19,164 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 494 transitions. Word has length 75 [2024-10-14 13:48:19,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:48:19,165 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 494 transitions. [2024-10-14 13:48:19,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:48:19,165 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 494 transitions. [2024-10-14 13:48:19,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-14 13:48:19,166 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:48:19,166 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:48:19,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 13:48:19,166 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:48:19,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:48:19,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1071944993, now seen corresponding path program 1 times [2024-10-14 13:48:19,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:48:19,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425713951] [2024-10-14 13:48:19,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:48:19,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:48:19,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:19,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:48:19,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:19,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:48:19,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:19,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:48:19,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:19,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:48:19,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:19,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:48:19,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:19,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:48:19,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:19,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:48:19,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:19,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:48:19,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:19,334 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-14 13:48:19,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:48:19,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425713951] [2024-10-14 13:48:19,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425713951] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:48:19,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:48:19,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 13:48:19,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677058466] [2024-10-14 13:48:19,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:48:19,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 13:48:19,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:48:19,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 13:48:19,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:48:19,336 INFO L87 Difference]: Start difference. First operand 386 states and 494 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:48:19,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:48:19,460 INFO L93 Difference]: Finished difference Result 881 states and 1119 transitions. [2024-10-14 13:48:19,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 13:48:19,464 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 75 [2024-10-14 13:48:19,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:48:19,467 INFO L225 Difference]: With dead ends: 881 [2024-10-14 13:48:19,467 INFO L226 Difference]: Without dead ends: 496 [2024-10-14 13:48:19,468 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 13:48:19,468 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 49 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:48:19,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 422 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:48:19,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2024-10-14 13:48:19,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 377. [2024-10-14 13:48:19,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 338 states have (on average 1.2337278106508875) internal successors, (417), 340 states have internal predecessors, (417), 28 states have call successors, (28), 10 states have call predecessors, (28), 10 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-14 13:48:19,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 473 transitions. [2024-10-14 13:48:19,518 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 473 transitions. Word has length 75 [2024-10-14 13:48:19,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:48:19,518 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 473 transitions. [2024-10-14 13:48:19,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:48:19,519 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 473 transitions. [2024-10-14 13:48:19,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-14 13:48:19,520 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:48:19,520 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:48:19,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 13:48:19,521 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:48:19,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:48:19,521 INFO L85 PathProgramCache]: Analyzing trace with hash -843101452, now seen corresponding path program 1 times [2024-10-14 13:48:19,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:48:19,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516575473] [2024-10-14 13:48:19,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:48:19,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:48:19,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:19,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:48:19,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:19,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:48:19,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:19,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:48:19,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:19,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:48:19,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:19,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:48:19,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:19,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:48:19,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:19,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:48:19,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:19,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:48:19,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:19,985 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-10-14 13:48:19,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:48:19,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516575473] [2024-10-14 13:48:19,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516575473] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 13:48:19,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768164540] [2024-10-14 13:48:19,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:48:19,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 13:48:19,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:48:19,987 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) [2024-10-14 13:48:19,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 13:48:20,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:20,149 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-14 13:48:20,153 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:48:20,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 13:48:20,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 13:48:20,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-14 13:48:20,560 INFO L378 Elim1Store]: Elim1 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 11 [2024-10-14 13:48:20,581 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 1 proven. 83 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-14 13:48:20,581 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 13:48:20,741 INFO L378 Elim1Store]: Elim1 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 36 treesize of output 32 [2024-10-14 13:48:20,841 INFO L378 Elim1Store]: Elim1 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 35 treesize of output 31 [2024-10-14 13:48:20,892 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-10-14 13:48:20,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [768164540] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 13:48:20,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 13:48:20,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 22 [2024-10-14 13:48:20,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336540145] [2024-10-14 13:48:20,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 13:48:20,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-14 13:48:20,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:48:20,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-14 13:48:20,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2024-10-14 13:48:20,895 INFO L87 Difference]: Start difference. First operand 377 states and 473 transitions. Second operand has 22 states, 19 states have (on average 4.315789473684211) internal successors, (82), 21 states have internal predecessors, (82), 9 states have call successors, (22), 5 states have call predecessors, (22), 7 states have return successors, (22), 6 states have call predecessors, (22), 9 states have call successors, (22) [2024-10-14 13:48:21,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:48:21,355 INFO L93 Difference]: Finished difference Result 739 states and 927 transitions. [2024-10-14 13:48:21,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 13:48:21,356 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 4.315789473684211) internal successors, (82), 21 states have internal predecessors, (82), 9 states have call successors, (22), 5 states have call predecessors, (22), 7 states have return successors, (22), 6 states have call predecessors, (22), 9 states have call successors, (22) Word has length 75 [2024-10-14 13:48:21,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:48:21,358 INFO L225 Difference]: With dead ends: 739 [2024-10-14 13:48:21,358 INFO L226 Difference]: Without dead ends: 363 [2024-10-14 13:48:21,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=234, Invalid=822, Unknown=0, NotChecked=0, Total=1056 [2024-10-14 13:48:21,360 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 251 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 13:48:21,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 374 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 13:48:21,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2024-10-14 13:48:21,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 347. [2024-10-14 13:48:21,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 308 states have (on average 1.2305194805194806) internal successors, (379), 310 states have internal predecessors, (379), 28 states have call successors, (28), 10 states have call predecessors, (28), 10 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-14 13:48:21,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 435 transitions. [2024-10-14 13:48:21,396 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 435 transitions. Word has length 75 [2024-10-14 13:48:21,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:48:21,397 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 435 transitions. [2024-10-14 13:48:21,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 4.315789473684211) internal successors, (82), 21 states have internal predecessors, (82), 9 states have call successors, (22), 5 states have call predecessors, (22), 7 states have return successors, (22), 6 states have call predecessors, (22), 9 states have call successors, (22) [2024-10-14 13:48:21,397 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 435 transitions. [2024-10-14 13:48:21,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-14 13:48:21,398 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:48:21,398 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:48:21,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 13:48:21,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-14 13:48:21,599 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:48:21,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:48:21,600 INFO L85 PathProgramCache]: Analyzing trace with hash 110180799, now seen corresponding path program 1 times [2024-10-14 13:48:21,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:48:21,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057817024] [2024-10-14 13:48:21,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:48:21,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:48:21,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:22,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:48:22,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:22,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:48:22,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:22,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:48:22,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:22,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:48:22,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:22,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:48:22,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:22,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:48:22,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:22,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:48:22,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:22,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:48:22,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:22,651 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-10-14 13:48:22,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:48:22,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057817024] [2024-10-14 13:48:22,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057817024] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 13:48:22,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332644388] [2024-10-14 13:48:22,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:48:22,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 13:48:22,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:48:22,654 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) [2024-10-14 13:48:22,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 13:48:22,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:22,817 INFO L255 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-14 13:48:22,822 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 13:48:22,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 13:48:22,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 13:48:23,066 INFO L378 Elim1Store]: Elim1 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 57 treesize of output 45 [2024-10-14 13:48:23,138 INFO L378 Elim1Store]: Elim1 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 49 treesize of output 29 [2024-10-14 13:48:23,260 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-14 13:48:23,260 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 13:48:23,502 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-14 13:48:23,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1332644388] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-14 13:48:23,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-14 13:48:23,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [19, 10] total 26 [2024-10-14 13:48:23,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667138267] [2024-10-14 13:48:23,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:48:23,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 13:48:23,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:48:23,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 13:48:23,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=591, Unknown=0, NotChecked=0, Total=650 [2024-10-14 13:48:23,505 INFO L87 Difference]: Start difference. First operand 347 states and 435 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:48:23,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:48:23,928 INFO L93 Difference]: Finished difference Result 855 states and 1070 transitions. [2024-10-14 13:48:23,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 13:48:23,929 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 76 [2024-10-14 13:48:23,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:48:23,934 INFO L225 Difference]: With dead ends: 855 [2024-10-14 13:48:23,934 INFO L226 Difference]: Without dead ends: 509 [2024-10-14 13:48:23,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=81, Invalid=849, Unknown=0, NotChecked=0, Total=930 [2024-10-14 13:48:23,936 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 50 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 13:48:23,936 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 868 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 13:48:23,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2024-10-14 13:48:23,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 168. [2024-10-14 13:48:23,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 148 states have (on average 1.2297297297297298) internal successors, (182), 149 states have internal predecessors, (182), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-14 13:48:23,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 210 transitions. [2024-10-14 13:48:23,955 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 210 transitions. Word has length 76 [2024-10-14 13:48:23,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:48:23,955 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 210 transitions. [2024-10-14 13:48:23,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:48:23,956 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 210 transitions. [2024-10-14 13:48:23,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-14 13:48:23,957 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:48:23,957 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:48:23,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-14 13:48:24,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 13:48:24,161 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:48:24,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:48:24,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1631279565, now seen corresponding path program 1 times [2024-10-14 13:48:24,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:48:24,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424662137] [2024-10-14 13:48:24,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:48:24,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:48:24,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:24,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:48:24,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:24,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:48:24,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:24,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:48:24,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:24,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:48:24,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:24,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:48:24,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:24,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:48:24,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:24,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:48:24,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:24,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:48:24,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:24,320 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-14 13:48:24,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:48:24,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424662137] [2024-10-14 13:48:24,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424662137] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:48:24,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:48:24,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:48:24,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071255491] [2024-10-14 13:48:24,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:48:24,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:48:24,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:48:24,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:48:24,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:48:24,322 INFO L87 Difference]: Start difference. First operand 168 states and 210 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:48:24,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:48:24,392 INFO L93 Difference]: Finished difference Result 403 states and 504 transitions. [2024-10-14 13:48:24,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:48:24,393 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 77 [2024-10-14 13:48:24,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:48:24,394 INFO L225 Difference]: With dead ends: 403 [2024-10-14 13:48:24,394 INFO L226 Difference]: Without dead ends: 236 [2024-10-14 13:48:24,395 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:48:24,395 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 41 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:48:24,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 299 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:48:24,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-10-14 13:48:24,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 168. [2024-10-14 13:48:24,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 148 states have (on average 1.2162162162162162) internal successors, (180), 149 states have internal predecessors, (180), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-14 13:48:24,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 208 transitions. [2024-10-14 13:48:24,410 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 208 transitions. Word has length 77 [2024-10-14 13:48:24,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:48:24,411 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 208 transitions. [2024-10-14 13:48:24,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:48:24,411 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 208 transitions. [2024-10-14 13:48:24,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-14 13:48:24,412 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:48:24,412 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:48:24,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 13:48:24,412 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:48:24,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:48:24,413 INFO L85 PathProgramCache]: Analyzing trace with hash 708920067, now seen corresponding path program 1 times [2024-10-14 13:48:24,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:48:24,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714454196] [2024-10-14 13:48:24,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:48:24,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:48:24,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:24,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:48:24,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:24,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:48:24,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:24,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:48:24,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:24,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:48:24,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:24,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:48:24,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:24,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:48:24,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:24,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:48:24,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:24,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:48:24,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:24,544 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-14 13:48:24,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:48:24,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714454196] [2024-10-14 13:48:24,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714454196] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:48:24,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:48:24,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:48:24,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203577829] [2024-10-14 13:48:24,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:48:24,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:48:24,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:48:24,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:48:24,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:48:24,546 INFO L87 Difference]: Start difference. First operand 168 states and 208 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:48:24,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:48:24,633 INFO L93 Difference]: Finished difference Result 395 states and 492 transitions. [2024-10-14 13:48:24,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:48:24,634 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 78 [2024-10-14 13:48:24,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:48:24,636 INFO L225 Difference]: With dead ends: 395 [2024-10-14 13:48:24,636 INFO L226 Difference]: Without dead ends: 228 [2024-10-14 13:48:24,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:48:24,637 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 31 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:48:24,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 299 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:48:24,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-10-14 13:48:24,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 178. [2024-10-14 13:48:24,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 158 states have (on average 1.2025316455696202) internal successors, (190), 159 states have internal predecessors, (190), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-14 13:48:24,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 218 transitions. [2024-10-14 13:48:24,666 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 218 transitions. Word has length 78 [2024-10-14 13:48:24,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:48:24,666 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 218 transitions. [2024-10-14 13:48:24,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:48:24,667 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 218 transitions. [2024-10-14 13:48:24,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-14 13:48:24,668 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:48:24,668 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:48:24,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-14 13:48:24,668 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:48:24,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:48:24,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1207142703, now seen corresponding path program 1 times [2024-10-14 13:48:24,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:48:24,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523580012] [2024-10-14 13:48:24,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:48:24,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:48:24,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:25,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:48:25,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:25,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:48:25,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:25,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:48:25,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:25,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:48:25,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:25,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:48:25,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:25,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:48:25,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:25,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:48:25,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:25,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:48:25,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:25,151 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-14 13:48:25,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:48:25,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523580012] [2024-10-14 13:48:25,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523580012] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:48:25,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:48:25,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-14 13:48:25,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286434786] [2024-10-14 13:48:25,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:48:25,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 13:48:25,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:48:25,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 13:48:25,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-14 13:48:25,153 INFO L87 Difference]: Start difference. First operand 178 states and 218 transitions. Second operand has 11 states, 10 states have (on average 4.1) internal successors, (41), 11 states have internal predecessors, (41), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-14 13:48:25,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:48:25,548 INFO L93 Difference]: Finished difference Result 491 states and 594 transitions. [2024-10-14 13:48:25,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 13:48:25,549 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.1) internal successors, (41), 11 states have internal predecessors, (41), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 78 [2024-10-14 13:48:25,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:48:25,551 INFO L225 Difference]: With dead ends: 491 [2024-10-14 13:48:25,551 INFO L226 Difference]: Without dead ends: 314 [2024-10-14 13:48:25,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2024-10-14 13:48:25,552 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 242 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 13:48:25,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 595 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 13:48:25,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2024-10-14 13:48:25,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 294. [2024-10-14 13:48:25,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 262 states have (on average 1.183206106870229) internal successors, (310), 265 states have internal predecessors, (310), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 19 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 13:48:25,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 354 transitions. [2024-10-14 13:48:25,584 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 354 transitions. Word has length 78 [2024-10-14 13:48:25,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:48:25,585 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 354 transitions. [2024-10-14 13:48:25,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.1) internal successors, (41), 11 states have internal predecessors, (41), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-14 13:48:25,585 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 354 transitions. [2024-10-14 13:48:25,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-14 13:48:25,586 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:48:25,586 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:48:25,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-14 13:48:25,586 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:48:25,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:48:25,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1425997421, now seen corresponding path program 1 times [2024-10-14 13:48:25,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:48:25,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210033884] [2024-10-14 13:48:25,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:48:25,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:48:25,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:25,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:48:25,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:25,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:48:25,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:25,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:48:25,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:25,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:48:25,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:25,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:48:25,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:25,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:48:25,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:25,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:48:25,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:25,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:48:25,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:25,678 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-14 13:48:25,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:48:25,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210033884] [2024-10-14 13:48:25,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210033884] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:48:25,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:48:25,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:48:25,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4129505] [2024-10-14 13:48:25,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:48:25,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:48:25,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:48:25,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:48:25,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:48:25,680 INFO L87 Difference]: Start difference. First operand 294 states and 354 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:48:25,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:48:25,798 INFO L93 Difference]: Finished difference Result 673 states and 810 transitions. [2024-10-14 13:48:25,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:48:25,799 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 78 [2024-10-14 13:48:25,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:48:25,801 INFO L225 Difference]: With dead ends: 673 [2024-10-14 13:48:25,801 INFO L226 Difference]: Without dead ends: 380 [2024-10-14 13:48:25,801 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:48:25,802 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 41 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:48:25,803 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 397 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:48:25,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2024-10-14 13:48:25,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 320. [2024-10-14 13:48:25,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 288 states have (on average 1.1736111111111112) internal successors, (338), 291 states have internal predecessors, (338), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 19 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 13:48:25,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 382 transitions. [2024-10-14 13:48:25,832 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 382 transitions. Word has length 78 [2024-10-14 13:48:25,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:48:25,832 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 382 transitions. [2024-10-14 13:48:25,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:48:25,833 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 382 transitions. [2024-10-14 13:48:25,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-14 13:48:25,833 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:48:25,834 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2024-10-14 13:48:25,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-14 13:48:25,834 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:48:25,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:48:25,834 INFO L85 PathProgramCache]: Analyzing trace with hash -2119412344, now seen corresponding path program 1 times [2024-10-14 13:48:25,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:48:25,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601316664] [2024-10-14 13:48:25,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:48:25,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:48:25,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:26,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:48:26,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:26,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:48:26,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:26,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:48:26,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:26,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:48:26,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:26,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:48:26,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:26,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:48:26,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:26,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:48:26,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:26,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:48:26,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:26,238 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-14 13:48:26,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:48:26,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601316664] [2024-10-14 13:48:26,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601316664] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:48:26,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:48:26,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:48:26,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138007830] [2024-10-14 13:48:26,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:48:26,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:48:26,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:48:26,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:48:26,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:48:26,240 INFO L87 Difference]: Start difference. First operand 320 states and 382 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:48:26,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:48:26,371 INFO L93 Difference]: Finished difference Result 370 states and 441 transitions. [2024-10-14 13:48:26,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:48:26,372 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 80 [2024-10-14 13:48:26,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:48:26,374 INFO L225 Difference]: With dead ends: 370 [2024-10-14 13:48:26,374 INFO L226 Difference]: Without dead ends: 368 [2024-10-14 13:48:26,375 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 13:48:26,375 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 60 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:48:26,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 341 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:48:26,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2024-10-14 13:48:26,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 364. [2024-10-14 13:48:26,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 319 states have (on average 1.1567398119122256) internal successors, (369), 323 states have internal predecessors, (369), 30 states have call successors, (30), 14 states have call predecessors, (30), 14 states have return successors, (30), 26 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-14 13:48:26,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 429 transitions. [2024-10-14 13:48:26,421 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 429 transitions. Word has length 80 [2024-10-14 13:48:26,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:48:26,422 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 429 transitions. [2024-10-14 13:48:26,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:48:26,422 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 429 transitions. [2024-10-14 13:48:26,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-14 13:48:26,423 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:48:26,423 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2024-10-14 13:48:26,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-14 13:48:26,423 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:48:26,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:48:26,423 INFO L85 PathProgramCache]: Analyzing trace with hash -2119352762, now seen corresponding path program 1 times [2024-10-14 13:48:26,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:48:26,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247841490] [2024-10-14 13:48:26,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:48:26,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:48:26,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:26,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:48:26,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:26,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:48:26,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:26,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:48:26,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:26,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:48:26,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:26,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:48:26,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:26,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:48:26,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:26,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:48:26,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:26,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:48:26,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:26,575 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-14 13:48:26,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:48:26,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247841490] [2024-10-14 13:48:26,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247841490] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:48:26,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:48:26,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:48:26,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890998120] [2024-10-14 13:48:26,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:48:26,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:48:26,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:48:26,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:48:26,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:48:26,577 INFO L87 Difference]: Start difference. First operand 364 states and 429 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:48:26,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:48:26,670 INFO L93 Difference]: Finished difference Result 695 states and 821 transitions. [2024-10-14 13:48:26,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:48:26,670 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 80 [2024-10-14 13:48:26,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:48:26,672 INFO L225 Difference]: With dead ends: 695 [2024-10-14 13:48:26,672 INFO L226 Difference]: Without dead ends: 368 [2024-10-14 13:48:26,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 13:48:26,674 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 48 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:48:26,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 323 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:48:26,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2024-10-14 13:48:26,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 211. [2024-10-14 13:48:26,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 183 states have (on average 1.1475409836065573) internal successors, (210), 185 states have internal predecessors, (210), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-14 13:48:26,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 246 transitions. [2024-10-14 13:48:26,708 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 246 transitions. Word has length 80 [2024-10-14 13:48:26,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:48:26,709 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 246 transitions. [2024-10-14 13:48:26,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:48:26,709 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 246 transitions. [2024-10-14 13:48:26,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-14 13:48:26,710 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:48:26,710 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2024-10-14 13:48:26,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-14 13:48:26,710 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:48:26,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:48:26,711 INFO L85 PathProgramCache]: Analyzing trace with hash -2062094460, now seen corresponding path program 1 times [2024-10-14 13:48:26,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:48:26,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660760146] [2024-10-14 13:48:26,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:48:26,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:48:26,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:27,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:48:27,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:27,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:48:27,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:27,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:48:27,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:27,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:48:27,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:27,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:48:27,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:27,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:48:27,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:27,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:48:27,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:27,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:48:27,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:27,182 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-14 13:48:27,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:48:27,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660760146] [2024-10-14 13:48:27,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660760146] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:48:27,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:48:27,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 13:48:27,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709385580] [2024-10-14 13:48:27,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:48:27,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 13:48:27,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:48:27,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 13:48:27,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 13:48:27,184 INFO L87 Difference]: Start difference. First operand 211 states and 246 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 13:48:27,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:48:27,428 INFO L93 Difference]: Finished difference Result 519 states and 607 transitions. [2024-10-14 13:48:27,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 13:48:27,429 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 80 [2024-10-14 13:48:27,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:48:27,430 INFO L225 Difference]: With dead ends: 519 [2024-10-14 13:48:27,431 INFO L226 Difference]: Without dead ends: 333 [2024-10-14 13:48:27,431 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-14 13:48:27,432 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 165 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:48:27,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 311 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:48:27,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2024-10-14 13:48:27,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 295. [2024-10-14 13:48:27,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 267 states have (on average 1.146067415730337) internal successors, (306), 269 states have internal predecessors, (306), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-14 13:48:27,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 342 transitions. [2024-10-14 13:48:27,473 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 342 transitions. Word has length 80 [2024-10-14 13:48:27,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:48:27,473 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 342 transitions. [2024-10-14 13:48:27,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 13:48:27,474 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 342 transitions. [2024-10-14 13:48:27,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-14 13:48:27,474 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:48:27,475 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2024-10-14 13:48:27,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-14 13:48:27,476 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:48:27,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:48:27,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1186718059, now seen corresponding path program 1 times [2024-10-14 13:48:27,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:48:27,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184743169] [2024-10-14 13:48:27,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:48:27,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:48:27,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:27,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:48:27,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:27,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:48:27,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:27,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:48:27,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:27,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:48:27,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:27,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:48:27,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:27,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:48:27,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:27,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:48:27,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:27,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:48:27,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:27,636 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-14 13:48:27,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:48:27,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184743169] [2024-10-14 13:48:27,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184743169] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:48:27,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:48:27,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:48:27,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786549906] [2024-10-14 13:48:27,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:48:27,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:48:27,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:48:27,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:48:27,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:48:27,639 INFO L87 Difference]: Start difference. First operand 295 states and 342 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:48:27,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:48:27,744 INFO L93 Difference]: Finished difference Result 613 states and 711 transitions. [2024-10-14 13:48:27,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:48:27,744 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 81 [2024-10-14 13:48:27,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:48:27,746 INFO L225 Difference]: With dead ends: 613 [2024-10-14 13:48:27,746 INFO L226 Difference]: Without dead ends: 343 [2024-10-14 13:48:27,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:48:27,747 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 31 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:48:27,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 382 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:48:27,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2024-10-14 13:48:27,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 257. [2024-10-14 13:48:27,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 229 states have (on average 1.1266375545851528) internal successors, (258), 231 states have internal predecessors, (258), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-14 13:48:27,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 294 transitions. [2024-10-14 13:48:27,784 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 294 transitions. Word has length 81 [2024-10-14 13:48:27,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:48:27,784 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 294 transitions. [2024-10-14 13:48:27,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:48:27,785 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 294 transitions. [2024-10-14 13:48:27,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-14 13:48:27,785 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:48:27,786 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2024-10-14 13:48:27,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-14 13:48:27,786 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:48:27,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:48:27,786 INFO L85 PathProgramCache]: Analyzing trace with hash 846304127, now seen corresponding path program 1 times [2024-10-14 13:48:27,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:48:27,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501065293] [2024-10-14 13:48:27,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:48:27,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:48:27,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:27,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:48:27,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:27,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:48:27,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:27,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:48:27,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:27,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:48:27,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:27,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:48:27,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:27,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:48:27,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:27,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:48:27,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:27,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:48:27,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:27,915 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-14 13:48:27,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:48:27,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501065293] [2024-10-14 13:48:27,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501065293] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:48:27,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:48:27,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:48:27,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497608500] [2024-10-14 13:48:27,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:48:27,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:48:27,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:48:27,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:48:27,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:48:27,918 INFO L87 Difference]: Start difference. First operand 257 states and 294 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:48:28,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:48:28,033 INFO L93 Difference]: Finished difference Result 566 states and 643 transitions. [2024-10-14 13:48:28,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:48:28,033 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 82 [2024-10-14 13:48:28,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:48:28,035 INFO L225 Difference]: With dead ends: 566 [2024-10-14 13:48:28,035 INFO L226 Difference]: Without dead ends: 334 [2024-10-14 13:48:28,036 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:48:28,036 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 22 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:48:28,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 259 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:48:28,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2024-10-14 13:48:28,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 316. [2024-10-14 13:48:28,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 288 states have (on average 1.1145833333333333) internal successors, (321), 290 states have internal predecessors, (321), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-14 13:48:28,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 357 transitions. [2024-10-14 13:48:28,072 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 357 transitions. Word has length 82 [2024-10-14 13:48:28,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:48:28,073 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 357 transitions. [2024-10-14 13:48:28,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:48:28,073 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 357 transitions. [2024-10-14 13:48:28,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-14 13:48:28,074 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:48:28,074 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2024-10-14 13:48:28,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-14 13:48:28,074 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:48:28,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:48:28,075 INFO L85 PathProgramCache]: Analyzing trace with hash -548655890, now seen corresponding path program 1 times [2024-10-14 13:48:28,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:48:28,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505577075] [2024-10-14 13:48:28,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:48:28,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:48:28,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:28,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:48:28,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:28,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:48:28,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:28,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:48:28,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:28,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:48:28,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:28,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:48:28,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:28,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:48:28,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:28,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:48:28,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:28,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:48:28,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:28,170 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-14 13:48:28,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:48:28,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505577075] [2024-10-14 13:48:28,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505577075] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:48:28,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:48:28,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 13:48:28,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820163347] [2024-10-14 13:48:28,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:48:28,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 13:48:28,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:48:28,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 13:48:28,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 13:48:28,171 INFO L87 Difference]: Start difference. First operand 316 states and 357 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:48:28,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:48:28,253 INFO L93 Difference]: Finished difference Result 544 states and 615 transitions. [2024-10-14 13:48:28,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 13:48:28,253 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 82 [2024-10-14 13:48:28,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:48:28,255 INFO L225 Difference]: With dead ends: 544 [2024-10-14 13:48:28,255 INFO L226 Difference]: Without dead ends: 253 [2024-10-14 13:48:28,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 13:48:28,256 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 13:48:28,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 211 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 13:48:28,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-10-14 13:48:28,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2024-10-14 13:48:28,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 225 states have (on average 1.1066666666666667) internal successors, (249), 227 states have internal predecessors, (249), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-14 13:48:28,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 285 transitions. [2024-10-14 13:48:28,293 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 285 transitions. Word has length 82 [2024-10-14 13:48:28,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:48:28,294 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 285 transitions. [2024-10-14 13:48:28,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:48:28,294 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 285 transitions. [2024-10-14 13:48:28,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-14 13:48:28,296 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:48:28,296 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:48:28,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-14 13:48:28,297 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:48:28,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:48:28,297 INFO L85 PathProgramCache]: Analyzing trace with hash -818166341, now seen corresponding path program 1 times [2024-10-14 13:48:28,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:48:28,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689055256] [2024-10-14 13:48:28,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:48:28,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:48:28,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:28,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:48:28,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:28,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:48:28,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:28,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:48:28,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:28,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:48:28,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:28,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:48:28,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:28,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:48:28,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:28,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:48:28,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:28,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:48:28,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:28,726 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-14 13:48:28,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:48:28,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689055256] [2024-10-14 13:48:28,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689055256] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:48:28,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:48:28,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 13:48:28,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972971648] [2024-10-14 13:48:28,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:48:28,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 13:48:28,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:48:28,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 13:48:28,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 13:48:28,729 INFO L87 Difference]: Start difference. First operand 253 states and 285 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 13:48:28,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:48:28,967 INFO L93 Difference]: Finished difference Result 489 states and 552 transitions. [2024-10-14 13:48:28,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 13:48:28,968 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 83 [2024-10-14 13:48:28,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:48:28,970 INFO L225 Difference]: With dead ends: 489 [2024-10-14 13:48:28,970 INFO L226 Difference]: Without dead ends: 261 [2024-10-14 13:48:28,971 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-10-14 13:48:28,971 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 110 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:48:28,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 313 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:48:28,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2024-10-14 13:48:29,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 255. [2024-10-14 13:48:29,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 227 states have (on average 1.105726872246696) internal successors, (251), 229 states have internal predecessors, (251), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-14 13:48:29,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 287 transitions. [2024-10-14 13:48:29,011 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 287 transitions. Word has length 83 [2024-10-14 13:48:29,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:48:29,011 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 287 transitions. [2024-10-14 13:48:29,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 13:48:29,012 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 287 transitions. [2024-10-14 13:48:29,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-14 13:48:29,013 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:48:29,013 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:48:29,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-14 13:48:29,013 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:48:29,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:48:29,014 INFO L85 PathProgramCache]: Analyzing trace with hash -39782315, now seen corresponding path program 1 times [2024-10-14 13:48:29,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:48:29,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004176599] [2024-10-14 13:48:29,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:48:29,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:48:29,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:29,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:48:29,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:29,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 13:48:29,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:29,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 13:48:29,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:29,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 13:48:29,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:29,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 13:48:29,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:29,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 13:48:29,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:29,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 13:48:29,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:29,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 13:48:29,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:48:29,129 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-14 13:48:29,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:48:29,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004176599] [2024-10-14 13:48:29,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004176599] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:48:29,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:48:29,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 13:48:29,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873499579] [2024-10-14 13:48:29,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:48:29,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 13:48:29,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:48:29,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 13:48:29,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 13:48:29,132 INFO L87 Difference]: Start difference. First operand 255 states and 287 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:48:29,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:48:29,248 INFO L93 Difference]: Finished difference Result 481 states and 537 transitions. [2024-10-14 13:48:29,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 13:48:29,249 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 85 [2024-10-14 13:48:29,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:48:29,250 INFO L225 Difference]: With dead ends: 481 [2024-10-14 13:48:29,250 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 13:48:29,251 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 13:48:29,251 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 22 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 13:48:29,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 322 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 13:48:29,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 13:48:29,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 13:48:29,252 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) [2024-10-14 13:48:29,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 13:48:29,253 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 85 [2024-10-14 13:48:29,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:48:29,253 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 13:48:29,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 13:48:29,253 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 13:48:29,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 13:48:29,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 13:48:29,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-14 13:48:29,259 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 13:48:29,261 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-14 13:48:46,460 WARN L286 SmtUtils]: Spent 16.08s on a formula simplification. DAG size of input: 241 DAG size of output: 205 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-10-14 13:48:51,197 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 13:48:51,209 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#7 [2024-10-14 13:48:51,212 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#7,GLOBAL] [2024-10-14 13:48:51,213 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#7,GLOBAL],[IdentifierExpression[~var_1_7_Pointer~0!base,GLOBAL]]] [2024-10-14 13:48:51,214 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#7 [2024-10-14 13:48:51,215 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#7,GLOBAL] [2024-10-14 13:48:51,215 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#7,GLOBAL],[IdentifierExpression[~var_1_7_Pointer~0!base,GLOBAL]]] [2024-10-14 13:48:51,215 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#7 [2024-10-14 13:48:51,215 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#7,GLOBAL] [2024-10-14 13:48:51,215 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#7,GLOBAL],[IdentifierExpression[~var_1_7_Pointer~0!base,GLOBAL]]] [2024-10-14 13:48:51,215 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#7 [2024-10-14 13:48:51,216 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#7,GLOBAL] [2024-10-14 13:48:51,216 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#7,GLOBAL],[IdentifierExpression[~var_1_7_Pointer~0!base,GLOBAL]]] [2024-10-14 13:48:51,216 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#10 [2024-10-14 13:48:51,216 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#10,GLOBAL] [2024-10-14 13:48:51,216 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#10,GLOBAL],[IdentifierExpression[~var_1_10_Pointer~0!base,GLOBAL]]] [2024-10-14 13:48:51,217 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#7 [2024-10-14 13:48:51,217 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#7,GLOBAL] [2024-10-14 13:48:51,217 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#7,GLOBAL],[IdentifierExpression[~var_1_7_Pointer~0!base,GLOBAL]]] [2024-10-14 13:48:51,217 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#10 [2024-10-14 13:48:51,217 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#10,GLOBAL] [2024-10-14 13:48:51,217 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#10,GLOBAL],[IdentifierExpression[~var_1_10_Pointer~0!base,GLOBAL]]] [2024-10-14 13:48:51,218 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#7 [2024-10-14 13:48:51,218 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#7,GLOBAL] [2024-10-14 13:48:51,218 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#7,GLOBAL],[IdentifierExpression[~var_1_7_Pointer~0!base,GLOBAL]]] [2024-10-14 13:48:51,218 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#7 [2024-10-14 13:48:51,218 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#7,GLOBAL] [2024-10-14 13:48:51,218 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#7,GLOBAL],[IdentifierExpression[~var_1_7_Pointer~0!base,GLOBAL]]] [2024-10-14 13:48:51,219 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#7 [2024-10-14 13:48:51,219 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#7,GLOBAL] [2024-10-14 13:48:51,219 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#7,GLOBAL],[IdentifierExpression[~var_1_7_Pointer~0!base,GLOBAL]]] [2024-10-14 13:48:51,219 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#8 [2024-10-14 13:48:51,219 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#8,GLOBAL] [2024-10-14 13:48:51,219 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#8,GLOBAL],[IdentifierExpression[~var_1_8_Pointer~0!base,GLOBAL]]] [2024-10-14 13:48:51,220 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2024-10-14 13:48:51,220 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2024-10-14 13:48:51,220 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~var_1_4_Pointer~0!base,GLOBAL]]] [2024-10-14 13:48:51,220 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#9 [2024-10-14 13:48:51,220 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#9,GLOBAL] [2024-10-14 13:48:51,220 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#9,GLOBAL],[IdentifierExpression[~var_1_9_Pointer~0!base,GLOBAL]]] [2024-10-14 13:48:51,220 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_4~0!base [2024-10-14 13:48:51,220 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_4_Pointer~0!base [2024-10-14 13:48:51,220 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_8_Pointer~0!base [2024-10-14 13:48:51,221 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_8~0!base [2024-10-14 13:48:51,221 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#9 [2024-10-14 13:48:51,221 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#9,GLOBAL] [2024-10-14 13:48:51,221 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#9,GLOBAL],[IdentifierExpression[~var_1_9_Pointer~0!base,GLOBAL]]] [2024-10-14 13:48:51,221 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#8 [2024-10-14 13:48:51,221 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#8,GLOBAL] [2024-10-14 13:48:51,221 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#8,GLOBAL],[IdentifierExpression[~var_1_8_Pointer~0!base,GLOBAL]]] [2024-10-14 13:48:51,221 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2024-10-14 13:48:51,221 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2024-10-14 13:48:51,221 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~var_1_4_Pointer~0!base,GLOBAL]]] [2024-10-14 13:48:51,222 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2024-10-14 13:48:51,222 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2024-10-14 13:48:51,222 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~var_1_4_Pointer~0!base,GLOBAL]]] [2024-10-14 13:48:51,222 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_6~0!offset [2024-10-14 13:48:51,222 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_6_Pointer~0!offset [2024-10-14 13:48:51,222 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_8~0!offset [2024-10-14 13:48:51,222 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_8_Pointer~0!offset [2024-10-14 13:48:51,222 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_4_Pointer~0!offset [2024-10-14 13:48:51,222 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_4~0!offset [2024-10-14 13:48:51,222 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#6 [2024-10-14 13:48:51,222 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#6,GLOBAL] [2024-10-14 13:48:51,223 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#6,GLOBAL],[IdentifierExpression[~var_1_6_Pointer~0!base,GLOBAL]]] [2024-10-14 13:48:51,223 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#7 [2024-10-14 13:48:51,223 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#7,GLOBAL] [2024-10-14 13:48:51,223 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#7,GLOBAL],[IdentifierExpression[~var_1_7_Pointer~0!base,GLOBAL]]] [2024-10-14 13:48:51,224 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#6 [2024-10-14 13:48:51,225 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#6,GLOBAL] [2024-10-14 13:48:51,225 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#6,GLOBAL],[IdentifierExpression[~var_1_6_Pointer~0!base,GLOBAL]]] [2024-10-14 13:48:51,225 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#8 [2024-10-14 13:48:51,225 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#8,GLOBAL] [2024-10-14 13:48:51,225 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#8,GLOBAL],[IdentifierExpression[~var_1_8_Pointer~0!base,GLOBAL]]] [2024-10-14 13:48:51,225 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_6~0!base [2024-10-14 13:48:51,225 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_6_Pointer~0!base [2024-10-14 13:48:51,226 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#8 [2024-10-14 13:48:51,227 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#8,GLOBAL] [2024-10-14 13:48:51,227 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#8,GLOBAL],[IdentifierExpression[~var_1_8_Pointer~0!base,GLOBAL]]] [2024-10-14 13:48:51,227 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#5 [2024-10-14 13:48:51,227 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#5,GLOBAL] [2024-10-14 13:48:51,227 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#5,GLOBAL],[IdentifierExpression[~var_1_5_Pointer~0!base,GLOBAL]]] [2024-10-14 13:48:51,228 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#6 [2024-10-14 13:48:51,228 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#6,GLOBAL] [2024-10-14 13:48:51,228 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#6,GLOBAL],[IdentifierExpression[~var_1_6_Pointer~0!base,GLOBAL]]] [2024-10-14 13:48:51,228 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#5 [2024-10-14 13:48:51,229 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#5,GLOBAL] [2024-10-14 13:48:51,229 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#5,GLOBAL],[IdentifierExpression[~var_1_5_Pointer~0!base,GLOBAL]]] [2024-10-14 13:48:51,229 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#6 [2024-10-14 13:48:51,229 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#6,GLOBAL] [2024-10-14 13:48:51,229 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#6,GLOBAL],[IdentifierExpression[~var_1_6_Pointer~0!base,GLOBAL]]] [2024-10-14 13:48:51,229 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2024-10-14 13:48:51,230 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2024-10-14 13:48:51,230 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~var_1_4_Pointer~0!base,GLOBAL]]] [2024-10-14 13:48:51,230 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#9 [2024-10-14 13:48:51,230 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#9,GLOBAL] [2024-10-14 13:48:51,230 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#9,GLOBAL],[IdentifierExpression[~var_1_9_Pointer~0!base,GLOBAL]]] [2024-10-14 13:48:51,230 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_4~0!base [2024-10-14 13:48:51,231 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_4_Pointer~0!base [2024-10-14 13:48:51,231 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_8_Pointer~0!base [2024-10-14 13:48:51,231 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_8~0!base [2024-10-14 13:48:51,231 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2024-10-14 13:48:51,231 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2024-10-14 13:48:51,231 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~var_1_4_Pointer~0!base,GLOBAL]]] [2024-10-14 13:48:51,232 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#6 [2024-10-14 13:48:51,232 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#6,GLOBAL] [2024-10-14 13:48:51,232 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#6,GLOBAL],[IdentifierExpression[~var_1_6_Pointer~0!base,GLOBAL]]] [2024-10-14 13:48:51,232 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#5 [2024-10-14 13:48:51,232 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#5,GLOBAL] [2024-10-14 13:48:51,232 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#5,GLOBAL],[IdentifierExpression[~var_1_5_Pointer~0!base,GLOBAL]]] [2024-10-14 13:48:51,233 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#6 [2024-10-14 13:48:51,233 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#6,GLOBAL] [2024-10-14 13:48:51,233 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#6,GLOBAL],[IdentifierExpression[~var_1_6_Pointer~0!base,GLOBAL]]] [2024-10-14 13:48:51,233 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#5 [2024-10-14 13:48:51,233 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#5,GLOBAL] [2024-10-14 13:48:51,234 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#5,GLOBAL],[IdentifierExpression[~var_1_5_Pointer~0!base,GLOBAL]]] [2024-10-14 13:48:51,234 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2024-10-14 13:48:51,234 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2024-10-14 13:48:51,234 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~var_1_4_Pointer~0!base,GLOBAL]]] [2024-10-14 13:48:51,234 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_6~0!offset [2024-10-14 13:48:51,234 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_6_Pointer~0!offset [2024-10-14 13:48:51,234 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_8~0!offset [2024-10-14 13:48:51,235 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_8_Pointer~0!offset [2024-10-14 13:48:51,235 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_4_Pointer~0!offset [2024-10-14 13:48:51,235 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_4~0!offset [2024-10-14 13:48:51,235 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_6~0!base [2024-10-14 13:48:51,235 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_6_Pointer~0!base [2024-10-14 13:48:51,238 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2024-10-14 13:48:51,239 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2024-10-14 13:48:51,239 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~var_1_4_Pointer~0!base,GLOBAL]]] [2024-10-14 13:48:51,246 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_4~0!base [2024-10-14 13:48:51,247 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_4_Pointer~0!base [2024-10-14 13:48:51,247 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_8_Pointer~0!base [2024-10-14 13:48:51,247 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_8~0!base [2024-10-14 13:48:51,247 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2024-10-14 13:48:51,247 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2024-10-14 13:48:51,247 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~var_1_4_Pointer~0!base,GLOBAL]]] [2024-10-14 13:48:51,248 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2024-10-14 13:48:51,249 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2024-10-14 13:48:51,249 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~var_1_4_Pointer~0!base,GLOBAL]]] [2024-10-14 13:48:51,249 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_6~0!offset [2024-10-14 13:48:51,249 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_6_Pointer~0!offset [2024-10-14 13:48:51,249 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_8~0!offset [2024-10-14 13:48:51,249 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_8_Pointer~0!offset [2024-10-14 13:48:51,249 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_4_Pointer~0!offset [2024-10-14 13:48:51,250 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_4~0!offset [2024-10-14 13:48:51,250 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_6~0!base [2024-10-14 13:48:51,250 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_6_Pointer~0!base [2024-10-14 13:48:51,251 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_4~0!base [2024-10-14 13:48:51,251 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_4_Pointer~0!base [2024-10-14 13:48:51,251 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_8_Pointer~0!base [2024-10-14 13:48:51,251 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_8~0!base [2024-10-14 13:48:51,252 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2024-10-14 13:48:51,252 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2024-10-14 13:48:51,252 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~var_1_4_Pointer~0!base,GLOBAL]]] [2024-10-14 13:48:51,252 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2024-10-14 13:48:51,252 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2024-10-14 13:48:51,252 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~var_1_4_Pointer~0!base,GLOBAL]]] [2024-10-14 13:48:51,253 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_6~0!offset [2024-10-14 13:48:51,253 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_6_Pointer~0!offset [2024-10-14 13:48:51,253 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_8~0!offset [2024-10-14 13:48:51,253 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_8_Pointer~0!offset [2024-10-14 13:48:51,253 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_4_Pointer~0!offset [2024-10-14 13:48:51,253 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_4~0!offset [2024-10-14 13:48:51,253 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#var_1_6~0!base [2024-10-14 13:48:51,253 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~var_1_6_Pointer~0!base [2024-10-14 13:48:51,256 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 01:48:51 BoogieIcfgContainer [2024-10-14 13:48:51,256 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 13:48:51,256 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 13:48:51,257 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 13:48:51,257 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 13:48:51,258 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:48:08" (3/4) ... [2024-10-14 13:48:51,260 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 13:48:51,268 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-14 13:48:51,282 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-10-14 13:48:51,285 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-14 13:48:51,286 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-14 13:48:51,286 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 13:48:51,410 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 13:48:51,410 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 13:48:51,410 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 13:48:51,410 INFO L158 Benchmark]: Toolchain (without parser) took 44442.90ms. Allocated memory was 163.6MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 96.0MB in the beginning and 651.1MB in the end (delta: -555.1MB). Peak memory consumption was 624.4MB. Max. memory is 16.1GB. [2024-10-14 13:48:51,411 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 107.0MB. Free memory is still 67.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 13:48:51,411 INFO L158 Benchmark]: CACSL2BoogieTranslator took 381.83ms. Allocated memory is still 163.6MB. Free memory was 95.7MB in the beginning and 126.4MB in the end (delta: -30.6MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. [2024-10-14 13:48:51,411 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.57ms. Allocated memory is still 163.6MB. Free memory was 126.4MB in the beginning and 123.4MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 13:48:51,411 INFO L158 Benchmark]: Boogie Preprocessor took 83.06ms. Allocated memory is still 163.6MB. Free memory was 123.4MB in the beginning and 120.1MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 13:48:51,411 INFO L158 Benchmark]: RCFGBuilder took 678.08ms. Allocated memory is still 163.6MB. Free memory was 120.1MB in the beginning and 87.2MB in the end (delta: 32.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-10-14 13:48:51,411 INFO L158 Benchmark]: TraceAbstraction took 43082.97ms. Allocated memory was 163.6MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 86.5MB in the beginning and 659.5MB in the end (delta: -573.0MB). Peak memory consumption was 767.1MB. Max. memory is 16.1GB. [2024-10-14 13:48:51,412 INFO L158 Benchmark]: Witness Printer took 153.56ms. Allocated memory is still 1.3GB. Free memory was 659.5MB in the beginning and 651.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-14 13:48:51,413 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 107.0MB. Free memory is still 67.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 381.83ms. Allocated memory is still 163.6MB. Free memory was 95.7MB in the beginning and 126.4MB in the end (delta: -30.6MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.57ms. Allocated memory is still 163.6MB. Free memory was 126.4MB in the beginning and 123.4MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 83.06ms. Allocated memory is still 163.6MB. Free memory was 123.4MB in the beginning and 120.1MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 678.08ms. Allocated memory is still 163.6MB. Free memory was 120.1MB in the beginning and 87.2MB in the end (delta: 32.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 43082.97ms. Allocated memory was 163.6MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 86.5MB in the beginning and 659.5MB in the end (delta: -573.0MB). Peak memory consumption was 767.1MB. Max. memory is 16.1GB. * Witness Printer took 153.56ms. Allocated memory is still 1.3GB. Free memory was 659.5MB in the beginning and 651.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#7 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#7,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#7,GLOBAL],[IdentifierExpression[~var_1_7_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#7 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#7,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#7,GLOBAL],[IdentifierExpression[~var_1_7_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#7 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#7,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#7,GLOBAL],[IdentifierExpression[~var_1_7_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#7 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#7,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#7,GLOBAL],[IdentifierExpression[~var_1_7_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#10 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#10,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#10,GLOBAL],[IdentifierExpression[~var_1_10_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#7 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#7,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#7,GLOBAL],[IdentifierExpression[~var_1_7_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#10 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#10,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#10,GLOBAL],[IdentifierExpression[~var_1_10_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#7 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#7,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#7,GLOBAL],[IdentifierExpression[~var_1_7_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#7 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#7,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#7,GLOBAL],[IdentifierExpression[~var_1_7_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#7 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#7,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#7,GLOBAL],[IdentifierExpression[~var_1_7_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#8 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#8,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#8,GLOBAL],[IdentifierExpression[~var_1_8_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~var_1_4_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#9 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#9,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#9,GLOBAL],[IdentifierExpression[~var_1_9_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_4~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_4_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_8_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_8~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#9 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#9,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#9,GLOBAL],[IdentifierExpression[~var_1_9_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#8 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#8,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#8,GLOBAL],[IdentifierExpression[~var_1_8_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~var_1_4_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~var_1_4_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_6~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_6_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_8~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_8_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_4_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_4~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#6 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#6,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#6,GLOBAL],[IdentifierExpression[~var_1_6_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#7 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#7,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#7,GLOBAL],[IdentifierExpression[~var_1_7_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#6 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#6,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#6,GLOBAL],[IdentifierExpression[~var_1_6_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#8 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#8,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#8,GLOBAL],[IdentifierExpression[~var_1_8_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_6~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_6_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#8 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#8,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#8,GLOBAL],[IdentifierExpression[~var_1_8_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#5 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#5,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#5,GLOBAL],[IdentifierExpression[~var_1_5_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#6 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#6,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#6,GLOBAL],[IdentifierExpression[~var_1_6_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#5 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#5,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#5,GLOBAL],[IdentifierExpression[~var_1_5_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#6 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#6,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#6,GLOBAL],[IdentifierExpression[~var_1_6_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~var_1_4_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#9 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#9,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#9,GLOBAL],[IdentifierExpression[~var_1_9_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_4~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_4_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_8_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_8~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~var_1_4_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#6 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#6,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#6,GLOBAL],[IdentifierExpression[~var_1_6_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#5 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#5,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#5,GLOBAL],[IdentifierExpression[~var_1_5_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#6 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#6,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#6,GLOBAL],[IdentifierExpression[~var_1_6_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#5 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#5,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#5,GLOBAL],[IdentifierExpression[~var_1_5_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~var_1_4_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_6~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_6_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_8~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_8_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_4_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_4~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_6~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_6_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~var_1_4_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_4~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_4_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_8_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_8~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~var_1_4_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~var_1_4_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_6~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_6_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_8~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_8_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_4_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_4~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_6~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_6_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_4~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_4_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_8_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_8~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~var_1_4_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~var_1_4_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_6~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_6_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_8~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_8_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_4_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_4~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#var_1_6~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~var_1_6_Pointer~0!base * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 66 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.0s, OverallIterations: 29, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3305 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3305 mSDsluCounter, 12607 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9880 mSDsCounter, 323 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4212 IncrementalHoareTripleChecker+Invalid, 4535 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 323 mSolverCounterUnsat, 2727 mSDtfsCounter, 4212 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1237 GetRequests, 955 SyntacticMatches, 0 SemanticMatches, 282 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1001 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=386occurred in iteration=14, InterpolantAutomatonStates: 217, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 29 MinimizatonAttempts, 1474 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 10.8s InterpolantComputationTime, 2422 NumberOfCodeBlocks, 2422 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2612 ConstructedInterpolants, 0 QuantifiedInterpolants, 13374 SizeOfPredicates, 41 NumberOfNonLiveVariables, 1087 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 35 InterpolantComputations, 27 PerfectInterpolantSequences, 3702/3920 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: null - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (cond != 0) RESULT: Ultimate proved your program to be correct! [2024-10-14 13:48:51,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE