./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product58.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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/product-lines/minepump_spec4_product58.cil.c -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 debcf50bf3bb3961401c62ca4b7217ea7cc93038f750143121614e56b550164d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 19:42:08,226 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 19:42:08,301 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 19:42:08,306 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 19:42:08,308 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 19:42:08,335 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 19:42:08,336 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 19:42:08,336 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 19:42:08,337 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 19:42:08,338 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 19:42:08,338 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 19:42:08,338 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 19:42:08,339 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 19:42:08,341 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 19:42:08,341 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 19:42:08,341 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 19:42:08,342 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 19:42:08,342 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 19:42:08,342 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 19:42:08,342 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 19:42:08,343 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 19:42:08,343 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 19:42:08,344 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 19:42:08,344 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 19:42:08,344 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 19:42:08,344 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 19:42:08,345 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 19:42:08,345 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 19:42:08,345 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 19:42:08,346 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 19:42:08,346 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 19:42:08,346 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 19:42:08,346 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:42:08,347 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 19:42:08,347 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 19:42:08,347 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 19:42:08,347 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 19:42:08,347 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 19:42:08,347 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 19:42:08,348 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 19:42:08,348 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 19:42:08,348 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 19:42:08,348 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 -> debcf50bf3bb3961401c62ca4b7217ea7cc93038f750143121614e56b550164d [2024-10-12 19:42:08,642 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 19:42:08,667 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 19:42:08,670 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 19:42:08,672 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 19:42:08,672 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 19:42:08,673 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product58.cil.c [2024-10-12 19:42:10,135 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 19:42:10,389 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 19:42:10,390 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product58.cil.c [2024-10-12 19:42:10,402 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb11c630e/7412c4b364a2433194504345e89f5f51/FLAGe526f1860 [2024-10-12 19:42:10,708 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb11c630e/7412c4b364a2433194504345e89f5f51 [2024-10-12 19:42:10,710 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 19:42:10,711 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 19:42:10,712 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 19:42:10,712 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 19:42:10,717 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 19:42:10,718 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:42:10" (1/1) ... [2024-10-12 19:42:10,719 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14d3d5d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:42:10, skipping insertion in model container [2024-10-12 19:42:10,719 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:42:10" (1/1) ... [2024-10-12 19:42:10,759 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 19:42:11,003 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/product-lines/minepump_spec4_product58.cil.c[11718,11731] [2024-10-12 19:42:11,034 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:42:11,043 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 19:42:11,053 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [49] [2024-10-12 19:42:11,054 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification4_spec.i","") [415] [2024-10-12 19:42:11,054 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [444] [2024-10-12 19:42:11,055 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [453] [2024-10-12 19:42:11,055 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [563] [2024-10-12 19:42:11,055 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [665] [2024-10-12 19:42:11,055 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [700] [2024-10-12 19:42:11,055 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [926] [2024-10-12 19:42:11,089 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/product-lines/minepump_spec4_product58.cil.c[11718,11731] [2024-10-12 19:42:11,117 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:42:11,140 INFO L204 MainTranslator]: Completed translation [2024-10-12 19:42:11,141 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:42:11 WrapperNode [2024-10-12 19:42:11,141 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 19:42:11,142 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 19:42:11,142 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 19:42:11,142 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 19:42:11,149 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:42:11" (1/1) ... [2024-10-12 19:42:11,165 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:42:11" (1/1) ... [2024-10-12 19:42:11,196 INFO L138 Inliner]: procedures = 57, calls = 101, calls flagged for inlining = 27, calls inlined = 24, statements flattened = 230 [2024-10-12 19:42:11,196 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 19:42:11,197 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 19:42:11,197 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 19:42:11,197 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 19:42:11,208 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:42:11" (1/1) ... [2024-10-12 19:42:11,208 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:42:11" (1/1) ... [2024-10-12 19:42:11,210 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:42:11" (1/1) ... [2024-10-12 19:42:11,230 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 19:42:11,230 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:42:11" (1/1) ... [2024-10-12 19:42:11,231 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:42:11" (1/1) ... [2024-10-12 19:42:11,247 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:42:11" (1/1) ... [2024-10-12 19:42:11,255 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:42:11" (1/1) ... [2024-10-12 19:42:11,259 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:42:11" (1/1) ... [2024-10-12 19:42:11,261 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:42:11" (1/1) ... [2024-10-12 19:42:11,265 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 19:42:11,266 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 19:42:11,266 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 19:42:11,266 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 19:42:11,267 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:42:11" (1/1) ... [2024-10-12 19:42:11,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:42:11,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:42:11,302 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-12 19:42:11,308 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-12 19:42:11,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 19:42:11,355 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-10-12 19:42:11,355 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-10-12 19:42:11,355 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-12 19:42:11,356 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-12 19:42:11,356 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-12 19:42:11,356 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-12 19:42:11,356 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2024-10-12 19:42:11,356 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2024-10-12 19:42:11,356 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-10-12 19:42:11,357 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-10-12 19:42:11,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 19:42:11,357 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-10-12 19:42:11,357 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-10-12 19:42:11,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 19:42:11,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 19:42:11,447 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 19:42:11,451 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 19:42:11,840 INFO L? ?]: Removed 52 outVars from TransFormulas that were not future-live. [2024-10-12 19:42:11,840 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 19:42:11,894 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 19:42:11,895 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-12 19:42:11,895 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:42:11 BoogieIcfgContainer [2024-10-12 19:42:11,896 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 19:42:11,897 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 19:42:11,897 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 19:42:11,900 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 19:42:11,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 07:42:10" (1/3) ... [2024-10-12 19:42:11,901 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f258027 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:42:11, skipping insertion in model container [2024-10-12 19:42:11,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:42:11" (2/3) ... [2024-10-12 19:42:11,902 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f258027 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:42:11, skipping insertion in model container [2024-10-12 19:42:11,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:42:11" (3/3) ... [2024-10-12 19:42:11,904 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec4_product58.cil.c [2024-10-12 19:42:11,917 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 19:42:11,917 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 19:42:11,970 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 19:42:11,976 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;@3c410a02, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 19:42:11,976 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 19:42:11,979 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 47 states have (on average 1.574468085106383) internal successors, (74), 55 states have internal predecessors, (74), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-12 19:42:11,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-12 19:42:11,984 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:42:11,985 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:42:11,985 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:42:11,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:42:11,990 INFO L85 PathProgramCache]: Analyzing trace with hash 2103361826, now seen corresponding path program 1 times [2024-10-12 19:42:11,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:42:11,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461775334] [2024-10-12 19:42:11,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:42:11,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:42:12,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:12,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:42:12,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:42:12,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461775334] [2024-10-12 19:42:12,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461775334] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:42:12,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:42:12,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 19:42:12,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741512257] [2024-10-12 19:42:12,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:42:12,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 19:42:12,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:42:12,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 19:42:12,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 19:42:12,178 INFO L87 Difference]: Start difference. First operand has 65 states, 47 states have (on average 1.574468085106383) internal successors, (74), 55 states have internal predecessors, (74), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 19:42:12,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:42:12,242 INFO L93 Difference]: Finished difference Result 128 states and 189 transitions. [2024-10-12 19:42:12,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 19:42:12,246 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-12 19:42:12,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:42:12,258 INFO L225 Difference]: With dead ends: 128 [2024-10-12 19:42:12,258 INFO L226 Difference]: Without dead ends: 60 [2024-10-12 19:42:12,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-12 19:42:12,266 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:42:12,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:42:12,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-12 19:42:12,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-10-12 19:42:12,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 51 states have internal predecessors, (64), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-12 19:42:12,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 83 transitions. [2024-10-12 19:42:12,313 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 83 transitions. Word has length 12 [2024-10-12 19:42:12,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:42:12,313 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 83 transitions. [2024-10-12 19:42:12,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 19:42:12,314 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 83 transitions. [2024-10-12 19:42:12,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-12 19:42:12,316 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:42:12,316 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:42:12,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 19:42:12,317 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:42:12,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:42:12,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1533361598, now seen corresponding path program 1 times [2024-10-12 19:42:12,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:42:12,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957711381] [2024-10-12 19:42:12,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:42:12,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:42:12,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:12,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:42:12,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:42:12,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957711381] [2024-10-12 19:42:12,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957711381] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:42:12,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:42:12,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 19:42:12,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481936867] [2024-10-12 19:42:12,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:42:12,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 19:42:12,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:42:12,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 19:42:12,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 19:42:12,422 INFO L87 Difference]: Start difference. First operand 60 states and 83 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 19:42:12,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:42:12,473 INFO L93 Difference]: Finished difference Result 93 states and 129 transitions. [2024-10-12 19:42:12,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 19:42:12,474 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-12 19:42:12,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:42:12,475 INFO L225 Difference]: With dead ends: 93 [2024-10-12 19:42:12,475 INFO L226 Difference]: Without dead ends: 52 [2024-10-12 19:42:12,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 19:42:12,476 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 11 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:42:12,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 105 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:42:12,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-12 19:42:12,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-10-12 19:42:12,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 39 states have (on average 1.4871794871794872) internal successors, (58), 46 states have internal predecessors, (58), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-12 19:42:12,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 72 transitions. [2024-10-12 19:42:12,491 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 72 transitions. Word has length 13 [2024-10-12 19:42:12,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:42:12,491 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 72 transitions. [2024-10-12 19:42:12,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 19:42:12,491 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 72 transitions. [2024-10-12 19:42:12,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-12 19:42:12,493 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:42:12,493 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:42:12,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 19:42:12,493 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:42:12,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:42:12,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1809587476, now seen corresponding path program 1 times [2024-10-12 19:42:12,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:42:12,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595586893] [2024-10-12 19:42:12,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:42:12,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:42:12,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:12,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:42:12,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:42:12,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595586893] [2024-10-12 19:42:12,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595586893] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:42:12,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:42:12,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 19:42:12,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396461358] [2024-10-12 19:42:12,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:42:12,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 19:42:12,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:42:12,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 19:42:12,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 19:42:12,579 INFO L87 Difference]: Start difference. First operand 52 states and 72 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 19:42:12,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:42:12,620 INFO L93 Difference]: Finished difference Result 102 states and 143 transitions. [2024-10-12 19:42:12,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 19:42:12,621 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-12 19:42:12,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:42:12,622 INFO L225 Difference]: With dead ends: 102 [2024-10-12 19:42:12,622 INFO L226 Difference]: Without dead ends: 52 [2024-10-12 19:42:12,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 19:42:12,624 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 67 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:42:12,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 57 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:42:12,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-12 19:42:12,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-10-12 19:42:12,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 39 states have (on average 1.4615384615384615) internal successors, (57), 46 states have internal predecessors, (57), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-12 19:42:12,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 71 transitions. [2024-10-12 19:42:12,632 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 71 transitions. Word has length 16 [2024-10-12 19:42:12,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:42:12,632 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 71 transitions. [2024-10-12 19:42:12,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 19:42:12,632 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2024-10-12 19:42:12,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-12 19:42:12,633 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:42:12,633 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:42:12,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 19:42:12,634 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:42:12,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:42:12,634 INFO L85 PathProgramCache]: Analyzing trace with hash -528868906, now seen corresponding path program 1 times [2024-10-12 19:42:12,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:42:12,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698081280] [2024-10-12 19:42:12,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:42:12,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:42:12,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:12,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:42:12,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:42:12,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698081280] [2024-10-12 19:42:12,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698081280] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:42:12,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:42:12,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 19:42:12,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16842732] [2024-10-12 19:42:12,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:42:12,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 19:42:12,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:42:12,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 19:42:12,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 19:42:12,744 INFO L87 Difference]: Start difference. First operand 52 states and 71 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 19:42:12,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:42:12,816 INFO L93 Difference]: Finished difference Result 137 states and 190 transitions. [2024-10-12 19:42:12,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 19:42:12,817 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-10-12 19:42:12,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:42:12,819 INFO L225 Difference]: With dead ends: 137 [2024-10-12 19:42:12,819 INFO L226 Difference]: Without dead ends: 87 [2024-10-12 19:42:12,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 19:42:12,823 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 45 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:42:12,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 99 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:42:12,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-12 19:42:12,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2024-10-12 19:42:12,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 64 states have (on average 1.40625) internal successors, (90), 72 states have internal predecessors, (90), 10 states have call successors, (10), 10 states have call predecessors, (10), 10 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) [2024-10-12 19:42:12,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 114 transitions. [2024-10-12 19:42:12,852 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 114 transitions. Word has length 21 [2024-10-12 19:42:12,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:42:12,853 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 114 transitions. [2024-10-12 19:42:12,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 19:42:12,853 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 114 transitions. [2024-10-12 19:42:12,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-12 19:42:12,854 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:42:12,854 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:42:12,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 19:42:12,855 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:42:12,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:42:12,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1482220812, now seen corresponding path program 1 times [2024-10-12 19:42:12,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:42:12,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353458721] [2024-10-12 19:42:12,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:42:12,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:42:12,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:13,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:42:13,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:13,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:42:13,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:42:13,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353458721] [2024-10-12 19:42:13,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353458721] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:42:13,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:42:13,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:42:13,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359807641] [2024-10-12 19:42:13,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:42:13,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:42:13,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:42:13,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:42:13,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:42:13,063 INFO L87 Difference]: Start difference. First operand 85 states and 114 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 19:42:13,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:42:13,325 INFO L93 Difference]: Finished difference Result 255 states and 361 transitions. [2024-10-12 19:42:13,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:42:13,325 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2024-10-12 19:42:13,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:42:13,332 INFO L225 Difference]: With dead ends: 255 [2024-10-12 19:42:13,332 INFO L226 Difference]: Without dead ends: 172 [2024-10-12 19:42:13,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 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-12 19:42:13,334 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 118 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:42:13,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 164 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 19:42:13,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-10-12 19:42:13,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 166. [2024-10-12 19:42:13,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 127 states have (on average 1.3779527559055118) internal successors, (175), 138 states have internal predecessors, (175), 18 states have call successors, (18), 18 states have call predecessors, (18), 20 states have return successors, (32), 18 states have call predecessors, (32), 18 states have call successors, (32) [2024-10-12 19:42:13,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 225 transitions. [2024-10-12 19:42:13,388 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 225 transitions. Word has length 30 [2024-10-12 19:42:13,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:42:13,389 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 225 transitions. [2024-10-12 19:42:13,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 19:42:13,389 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 225 transitions. [2024-10-12 19:42:13,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-12 19:42:13,390 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:42:13,390 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:42:13,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 19:42:13,391 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:42:13,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:42:13,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1801629234, now seen corresponding path program 1 times [2024-10-12 19:42:13,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:42:13,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753741455] [2024-10-12 19:42:13,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:42:13,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:42:13,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:13,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:42:13,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:13,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:42:13,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:42:13,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753741455] [2024-10-12 19:42:13,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753741455] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:42:13,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:42:13,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 19:42:13,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173967964] [2024-10-12 19:42:13,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:42:13,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 19:42:13,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:42:13,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 19:42:13,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:42:13,457 INFO L87 Difference]: Start difference. First operand 166 states and 225 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 19:42:13,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:42:13,592 INFO L93 Difference]: Finished difference Result 336 states and 471 transitions. [2024-10-12 19:42:13,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 19:42:13,593 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2024-10-12 19:42:13,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:42:13,595 INFO L225 Difference]: With dead ends: 336 [2024-10-12 19:42:13,595 INFO L226 Difference]: Without dead ends: 172 [2024-10-12 19:42:13,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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-12 19:42:13,601 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 43 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:42:13,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 133 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:42:13,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-10-12 19:42:13,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 170. [2024-10-12 19:42:13,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 131 states have (on average 1.366412213740458) internal successors, (179), 142 states have internal predecessors, (179), 18 states have call successors, (18), 18 states have call predecessors, (18), 20 states have return successors, (32), 18 states have call predecessors, (32), 18 states have call successors, (32) [2024-10-12 19:42:13,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 229 transitions. [2024-10-12 19:42:13,628 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 229 transitions. Word has length 30 [2024-10-12 19:42:13,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:42:13,629 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 229 transitions. [2024-10-12 19:42:13,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 19:42:13,629 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 229 transitions. [2024-10-12 19:42:13,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-12 19:42:13,634 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:42:13,634 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:42:13,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 19:42:13,635 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:42:13,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:42:13,635 INFO L85 PathProgramCache]: Analyzing trace with hash -713949415, now seen corresponding path program 1 times [2024-10-12 19:42:13,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:42:13,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059936741] [2024-10-12 19:42:13,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:42:13,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:42:13,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:13,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:42:13,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:13,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:42:13,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:13,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:42:13,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:42:13,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059936741] [2024-10-12 19:42:13,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059936741] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:42:13,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:42:13,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 19:42:13,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778931682] [2024-10-12 19:42:13,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:42:13,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 19:42:13,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:42:13,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 19:42:13,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:42:13,742 INFO L87 Difference]: Start difference. First operand 170 states and 229 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 19:42:13,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:42:13,897 INFO L93 Difference]: Finished difference Result 338 states and 457 transitions. [2024-10-12 19:42:13,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:42:13,898 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 31 [2024-10-12 19:42:13,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:42:13,899 INFO L225 Difference]: With dead ends: 338 [2024-10-12 19:42:13,899 INFO L226 Difference]: Without dead ends: 170 [2024-10-12 19:42:13,900 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:42:13,901 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 101 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:42:13,901 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 130 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:42:13,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-10-12 19:42:13,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 168. [2024-10-12 19:42:13,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 129 states have (on average 1.3410852713178294) internal successors, (173), 140 states have internal predecessors, (173), 18 states have call successors, (18), 18 states have call predecessors, (18), 20 states have return successors, (32), 18 states have call predecessors, (32), 18 states have call successors, (32) [2024-10-12 19:42:13,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 223 transitions. [2024-10-12 19:42:13,919 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 223 transitions. Word has length 31 [2024-10-12 19:42:13,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:42:13,919 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 223 transitions. [2024-10-12 19:42:13,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 19:42:13,919 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 223 transitions. [2024-10-12 19:42:13,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-12 19:42:13,920 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:42:13,921 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:42:13,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 19:42:13,921 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:42:13,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:42:13,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1279587504, now seen corresponding path program 1 times [2024-10-12 19:42:13,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:42:13,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762366688] [2024-10-12 19:42:13,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:42:13,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:42:13,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:13,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-12 19:42:13,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:13,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 19:42:13,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:13,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:42:13,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:42:13,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762366688] [2024-10-12 19:42:13,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762366688] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:42:13,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:42:13,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:42:13,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41285328] [2024-10-12 19:42:13,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:42:13,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:42:13,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:42:13,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:42:13,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:42:13,997 INFO L87 Difference]: Start difference. First operand 168 states and 223 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-12 19:42:14,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:42:14,356 INFO L93 Difference]: Finished difference Result 382 states and 544 transitions. [2024-10-12 19:42:14,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 19:42:14,357 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2024-10-12 19:42:14,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:42:14,360 INFO L225 Difference]: With dead ends: 382 [2024-10-12 19:42:14,360 INFO L226 Difference]: Without dead ends: 281 [2024-10-12 19:42:14,364 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2024-10-12 19:42:14,365 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 147 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 19:42:14,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 190 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 19:42:14,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-10-12 19:42:14,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 262. [2024-10-12 19:42:14,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 200 states have (on average 1.32) internal successors, (264), 219 states have internal predecessors, (264), 28 states have call successors, (28), 26 states have call predecessors, (28), 33 states have return successors, (70), 31 states have call predecessors, (70), 28 states have call successors, (70) [2024-10-12 19:42:14,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 362 transitions. [2024-10-12 19:42:14,412 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 362 transitions. Word has length 34 [2024-10-12 19:42:14,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:42:14,412 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 362 transitions. [2024-10-12 19:42:14,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-12 19:42:14,413 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 362 transitions. [2024-10-12 19:42:14,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-12 19:42:14,414 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:42:14,414 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:42:14,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 19:42:14,414 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:42:14,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:42:14,415 INFO L85 PathProgramCache]: Analyzing trace with hash -2113808653, now seen corresponding path program 1 times [2024-10-12 19:42:14,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:42:14,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309197561] [2024-10-12 19:42:14,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:42:14,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:42:14,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:14,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-12 19:42:14,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:14,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 19:42:14,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:14,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:42:14,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:14,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:42:14,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:42:14,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309197561] [2024-10-12 19:42:14,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309197561] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:42:14,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:42:14,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:42:14,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110867728] [2024-10-12 19:42:14,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:42:14,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:42:14,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:42:14,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:42:14,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:42:14,506 INFO L87 Difference]: Start difference. First operand 262 states and 362 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 19:42:14,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:42:14,790 INFO L93 Difference]: Finished difference Result 282 states and 386 transitions. [2024-10-12 19:42:14,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 19:42:14,791 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2024-10-12 19:42:14,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:42:14,793 INFO L225 Difference]: With dead ends: 282 [2024-10-12 19:42:14,793 INFO L226 Difference]: Without dead ends: 280 [2024-10-12 19:42:14,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2024-10-12 19:42:14,795 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 149 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:42:14,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 145 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 19:42:14,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2024-10-12 19:42:14,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 262. [2024-10-12 19:42:14,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 200 states have (on average 1.305) internal successors, (261), 219 states have internal predecessors, (261), 28 states have call successors, (28), 26 states have call predecessors, (28), 33 states have return successors, (70), 31 states have call predecessors, (70), 28 states have call successors, (70) [2024-10-12 19:42:14,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 359 transitions. [2024-10-12 19:42:14,829 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 359 transitions. Word has length 35 [2024-10-12 19:42:14,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:42:14,829 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 359 transitions. [2024-10-12 19:42:14,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 19:42:14,830 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 359 transitions. [2024-10-12 19:42:14,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-12 19:42:14,832 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:42:14,833 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:42:14,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 19:42:14,833 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:42:14,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:42:14,834 INFO L85 PathProgramCache]: Analyzing trace with hash 770281651, now seen corresponding path program 1 times [2024-10-12 19:42:14,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:42:14,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637764050] [2024-10-12 19:42:14,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:42:14,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:42:14,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:14,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-12 19:42:14,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:14,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 19:42:14,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:14,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:42:14,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:42:14,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637764050] [2024-10-12 19:42:14,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637764050] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:42:14,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:42:14,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:42:14,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237129812] [2024-10-12 19:42:14,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:42:14,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:42:14,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:42:14,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:42:14,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:42:14,902 INFO L87 Difference]: Start difference. First operand 262 states and 359 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-12 19:42:15,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:42:15,094 INFO L93 Difference]: Finished difference Result 489 states and 681 transitions. [2024-10-12 19:42:15,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:42:15,095 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2024-10-12 19:42:15,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:42:15,097 INFO L225 Difference]: With dead ends: 489 [2024-10-12 19:42:15,097 INFO L226 Difference]: Without dead ends: 229 [2024-10-12 19:42:15,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-12 19:42:15,099 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 100 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:42:15,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 139 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:42:15,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-10-12 19:42:15,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 221. [2024-10-12 19:42:15,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 167 states have (on average 1.281437125748503) internal successors, (214), 182 states have internal predecessors, (214), 25 states have call successors, (25), 23 states have call predecessors, (25), 28 states have return successors, (54), 27 states have call predecessors, (54), 25 states have call successors, (54) [2024-10-12 19:42:15,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 293 transitions. [2024-10-12 19:42:15,120 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 293 transitions. Word has length 34 [2024-10-12 19:42:15,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:42:15,120 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 293 transitions. [2024-10-12 19:42:15,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-12 19:42:15,121 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 293 transitions. [2024-10-12 19:42:15,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-12 19:42:15,122 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:42:15,122 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:42:15,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 19:42:15,123 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:42:15,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:42:15,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1391046858, now seen corresponding path program 1 times [2024-10-12 19:42:15,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:42:15,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129230011] [2024-10-12 19:42:15,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:42:15,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:42:15,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:15,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-12 19:42:15,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:15,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:42:15,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:15,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 19:42:15,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:15,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-12 19:42:15,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:15,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:42:15,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:15,386 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 19:42:15,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:42:15,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129230011] [2024-10-12 19:42:15,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129230011] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:42:15,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528978407] [2024-10-12 19:42:15,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:42:15,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:42:15,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:42:15,390 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-12 19:42:15,391 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-12 19:42:15,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:15,476 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 19:42:15,482 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:42:15,600 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:42:15,600 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:42:15,724 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 19:42:15,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528978407] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 19:42:15,724 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 19:42:15,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 8 [2024-10-12 19:42:15,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480097852] [2024-10-12 19:42:15,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 19:42:15,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 19:42:15,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:42:15,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 19:42:15,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:42:15,727 INFO L87 Difference]: Start difference. First operand 221 states and 293 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 5 states have internal predecessors, (58), 3 states have call successors, (12), 6 states have call predecessors, (12), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:42:16,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:42:16,198 INFO L93 Difference]: Finished difference Result 528 states and 746 transitions. [2024-10-12 19:42:16,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-12 19:42:16,200 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 5 states have internal predecessors, (58), 3 states have call successors, (12), 6 states have call predecessors, (12), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 63 [2024-10-12 19:42:16,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:42:16,203 INFO L225 Difference]: With dead ends: 528 [2024-10-12 19:42:16,205 INFO L226 Difference]: Without dead ends: 345 [2024-10-12 19:42:16,207 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 135 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2024-10-12 19:42:16,207 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 220 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 19:42:16,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 237 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 19:42:16,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-10-12 19:42:16,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 303. [2024-10-12 19:42:16,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 227 states have (on average 1.2863436123348018) internal successors, (292), 248 states have internal predecessors, (292), 36 states have call successors, (36), 33 states have call predecessors, (36), 39 states have return successors, (82), 36 states have call predecessors, (82), 36 states have call successors, (82) [2024-10-12 19:42:16,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 410 transitions. [2024-10-12 19:42:16,239 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 410 transitions. Word has length 63 [2024-10-12 19:42:16,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:42:16,239 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 410 transitions. [2024-10-12 19:42:16,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 5 states have internal predecessors, (58), 3 states have call successors, (12), 6 states have call predecessors, (12), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:42:16,240 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 410 transitions. [2024-10-12 19:42:16,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-12 19:42:16,242 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:42:16,242 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:42:16,261 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-12 19:42:16,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-12 19:42:16,443 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:42:16,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:42:16,444 INFO L85 PathProgramCache]: Analyzing trace with hash 677256849, now seen corresponding path program 2 times [2024-10-12 19:42:16,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:42:16,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301233932] [2024-10-12 19:42:16,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:42:16,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:42:16,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:16,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-12 19:42:16,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:16,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:42:16,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:16,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 19:42:16,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:16,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-12 19:42:16,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:16,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:42:16,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:16,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:42:16,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:16,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-12 19:42:16,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:16,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:42:16,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:16,688 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 44 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 19:42:16,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:42:16,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301233932] [2024-10-12 19:42:16,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301233932] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:42:16,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1897198638] [2024-10-12 19:42:16,689 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 19:42:16,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:42:16,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:42:16,691 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-12 19:42:16,704 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-12 19:42:16,792 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 19:42:16,793 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 19:42:16,794 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-12 19:42:16,797 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:42:16,872 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-12 19:42:16,873 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 19:42:16,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1897198638] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:42:16,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 19:42:16,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-10-12 19:42:16,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901914172] [2024-10-12 19:42:16,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:42:16,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 19:42:16,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:42:16,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 19:42:16,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-10-12 19:42:16,875 INFO L87 Difference]: Start difference. First operand 303 states and 410 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-12 19:42:17,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:42:17,064 INFO L93 Difference]: Finished difference Result 801 states and 1143 transitions. [2024-10-12 19:42:17,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:42:17,065 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 92 [2024-10-12 19:42:17,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:42:17,068 INFO L225 Difference]: With dead ends: 801 [2024-10-12 19:42:17,068 INFO L226 Difference]: Without dead ends: 535 [2024-10-12 19:42:17,070 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 103 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-10-12 19:42:17,070 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 114 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:42:17,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 251 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:42:17,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2024-10-12 19:42:17,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 514. [2024-10-12 19:42:17,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 387 states have (on average 1.2790697674418605) internal successors, (495), 416 states have internal predecessors, (495), 61 states have call successors, (61), 58 states have call predecessors, (61), 65 states have return successors, (125), 61 states have call predecessors, (125), 61 states have call successors, (125) [2024-10-12 19:42:17,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 681 transitions. [2024-10-12 19:42:17,112 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 681 transitions. Word has length 92 [2024-10-12 19:42:17,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:42:17,113 INFO L471 AbstractCegarLoop]: Abstraction has 514 states and 681 transitions. [2024-10-12 19:42:17,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-12 19:42:17,113 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 681 transitions. [2024-10-12 19:42:17,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-12 19:42:17,115 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:42:17,115 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:42:17,133 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-12 19:42:17,315 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,SelfDestructingSolverStorable11 [2024-10-12 19:42:17,316 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:42:17,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:42:17,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1570743187, now seen corresponding path program 1 times [2024-10-12 19:42:17,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:42:17,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655313433] [2024-10-12 19:42:17,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:42:17,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:42:17,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:17,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-12 19:42:17,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:17,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:42:17,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:17,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 19:42:17,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:17,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-12 19:42:17,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:17,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:42:17,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:17,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:42:17,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:17,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-12 19:42:17,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:17,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:42:17,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:42:17,439 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-12 19:42:17,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:42:17,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655313433] [2024-10-12 19:42:17,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655313433] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:42:17,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:42:17,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:42:17,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210528396] [2024-10-12 19:42:17,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:42:17,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:42:17,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:42:17,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:42:17,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:42:17,441 INFO L87 Difference]: Start difference. First operand 514 states and 681 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 19:42:17,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:42:17,611 INFO L93 Difference]: Finished difference Result 714 states and 928 transitions. [2024-10-12 19:42:17,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:42:17,611 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 92 [2024-10-12 19:42:17,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:42:17,613 INFO L225 Difference]: With dead ends: 714 [2024-10-12 19:42:17,613 INFO L226 Difference]: Without dead ends: 0 [2024-10-12 19:42:17,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-12 19:42:17,615 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 50 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:42:17,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 117 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:42:17,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-12 19:42:17,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-12 19:42:17,616 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-12 19:42:17,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-12 19:42:17,616 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 92 [2024-10-12 19:42:17,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:42:17,616 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 19:42:17,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-12 19:42:17,617 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-12 19:42:17,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-12 19:42:17,620 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 19:42:17,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 19:42:17,622 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:42:17,624 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-12 19:42:18,662 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 19:42:18,689 WARN L155 FloydHoareUtils]: Requires clause for timeShift contained old-variable. Original clause: (and (= ~pumpRunning~0 |old(~pumpRunning~0)|) (= |old(~waterLevel~0)| ~waterLevel~0) (let ((.cse0 (= 1 ~systemActive~0))) (or (and .cse0 (<= 2 |old(~waterLevel~0)|)) (and .cse0 (= |old(~pumpRunning~0)| 0) (<= 1 |old(~waterLevel~0)|))))) Eliminated clause: (let ((.cse0 (= 1 ~systemActive~0))) (or (and (= ~pumpRunning~0 0) .cse0 (<= 1 ~waterLevel~0)) (and (<= 2 ~waterLevel~0) .cse0))) [2024-10-12 19:42:18,697 WARN L155 FloydHoareUtils]: Requires clause for processEnvironment__wrappee__highWaterSensor contained old-variable. Original clause: (and (= ~pumpRunning~0 0) (= 1 ~systemActive~0) (= |old(~pumpRunning~0)| 0) (<= 1 ~waterLevel~0)) Eliminated clause: (and (= ~pumpRunning~0 0) (= 1 ~systemActive~0) (<= 1 ~waterLevel~0)) [2024-10-12 19:42:18,699 WARN L155 FloydHoareUtils]: Requires clause for waterRise contained old-variable. Original clause: (and (let ((.cse0 (= 1 ~systemActive~0))) (or (and .cse0 (<= 2 |old(~waterLevel~0)|)) (and (= ~pumpRunning~0 0) .cse0 (<= 1 |old(~waterLevel~0)|)))) (= |old(~waterLevel~0)| ~waterLevel~0)) Eliminated clause: (let ((.cse0 (= 1 ~systemActive~0))) (or (and (= ~pumpRunning~0 0) .cse0 (<= 1 ~waterLevel~0)) (and (<= 2 ~waterLevel~0) .cse0))) [2024-10-12 19:42:18,703 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 07:42:18 BoogieIcfgContainer [2024-10-12 19:42:18,704 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 19:42:18,705 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 19:42:18,705 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 19:42:18,705 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 19:42:18,706 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:42:11" (3/4) ... [2024-10-12 19:42:18,707 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-12 19:42:18,711 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base [2024-10-12 19:42:18,711 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2024-10-12 19:42:18,711 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure timeShift [2024-10-12 19:42:18,711 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure cleanup [2024-10-12 19:42:18,711 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__highWaterSensor [2024-10-12 19:42:18,711 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure waterRise [2024-10-12 19:42:18,720 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 34 nodes and edges [2024-10-12 19:42:18,722 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2024-10-12 19:42:18,722 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-12 19:42:18,723 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-12 19:42:18,723 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-12 19:42:18,847 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 19:42:18,848 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-12 19:42:18,848 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 19:42:18,849 INFO L158 Benchmark]: Toolchain (without parser) took 8137.66ms. Allocated memory was 199.2MB in the beginning and 272.6MB in the end (delta: 73.4MB). Free memory was 122.5MB in the beginning and 174.4MB in the end (delta: -51.8MB). Peak memory consumption was 23.4MB. Max. memory is 16.1GB. [2024-10-12 19:42:18,849 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 199.2MB. Free memory is still 170.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 19:42:18,849 INFO L158 Benchmark]: CACSL2BoogieTranslator took 429.52ms. Allocated memory is still 199.2MB. Free memory was 122.5MB in the beginning and 101.4MB in the end (delta: 21.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-12 19:42:18,849 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.56ms. Allocated memory is still 199.2MB. Free memory was 101.0MB in the beginning and 98.7MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 19:42:18,849 INFO L158 Benchmark]: Boogie Preprocessor took 68.10ms. Allocated memory is still 199.2MB. Free memory was 98.7MB in the beginning and 96.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 19:42:18,850 INFO L158 Benchmark]: RCFGBuilder took 629.84ms. Allocated memory is still 199.2MB. Free memory was 96.2MB in the beginning and 152.7MB in the end (delta: -56.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-12 19:42:18,850 INFO L158 Benchmark]: TraceAbstraction took 6806.71ms. Allocated memory was 199.2MB in the beginning and 272.6MB in the end (delta: 73.4MB). Free memory was 151.7MB in the beginning and 181.7MB in the end (delta: -30.0MB). Peak memory consumption was 145.6MB. Max. memory is 16.1GB. [2024-10-12 19:42:18,850 INFO L158 Benchmark]: Witness Printer took 143.40ms. Allocated memory is still 272.6MB. Free memory was 181.7MB in the beginning and 174.4MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-12 19:42:18,851 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.18ms. Allocated memory is still 199.2MB. Free memory is still 170.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 429.52ms. Allocated memory is still 199.2MB. Free memory was 122.5MB in the beginning and 101.4MB in the end (delta: 21.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.56ms. Allocated memory is still 199.2MB. Free memory was 101.0MB in the beginning and 98.7MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.10ms. Allocated memory is still 199.2MB. Free memory was 98.7MB in the beginning and 96.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 629.84ms. Allocated memory is still 199.2MB. Free memory was 96.2MB in the beginning and 152.7MB in the end (delta: -56.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 6806.71ms. Allocated memory was 199.2MB in the beginning and 272.6MB in the end (delta: 73.4MB). Free memory was 151.7MB in the beginning and 181.7MB in the end (delta: -30.0MB). Peak memory consumption was 145.6MB. Max. memory is 16.1GB. * Witness Printer took 143.40ms. Allocated memory is still 272.6MB. Free memory was 181.7MB in the beginning and 174.4MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 49]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [49] - GenericResultAtLocation [Line: 415]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification4_spec.i","") [415] - GenericResultAtLocation [Line: 444]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [444] - GenericResultAtLocation [Line: 453]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [453] - GenericResultAtLocation [Line: 563]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [563] - GenericResultAtLocation [Line: 665]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [665] - GenericResultAtLocation [Line: 700]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [700] - GenericResultAtLocation [Line: 926]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [926] * 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: 449]: 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 7 procedures, 65 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.7s, OverallIterations: 13, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1184 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1165 mSDsluCounter, 1840 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1184 mSDsCounter, 244 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1827 IncrementalHoareTripleChecker+Invalid, 2071 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 244 mSolverCounterUnsat, 656 mSDtfsCounter, 1827 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 399 GetRequests, 301 SyntacticMatches, 9 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=514occurred in iteration=12, InterpolantAutomatonStates: 96, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 120 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 658 NumberOfCodeBlocks, 658 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 705 ConstructedInterpolants, 0 QuantifiedInterpolants, 1317 SizeOfPredicates, 3 NumberOfNonLiveVariables, 558 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 16 InterpolantComputations, 12 PerfectInterpolantSequences, 224/249 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: 937]: Loop Invariant Derived loop invariant: ((((2 <= waterLevel) && (1 == systemActive)) && (splverifierCounter == 0)) || ((((pumpRunning == 0) && (1 == systemActive)) && (splverifierCounter == 0)) && (1 <= waterLevel))) - InvariantResult [Line: 576]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 936]: Location Invariant Derived location invariant: 0 - ProcedureContractResult [Line: 731]: Procedure Contract for processEnvironment__wrappee__base Derived contract for procedure processEnvironment__wrappee__base. Requires: (((pumpRunning == 0) && (1 == systemActive)) && (1 <= waterLevel)) Ensures: (((pumpRunning == 0) && (1 == systemActive)) && (1 <= waterLevel)) - ProcedureContractResult [Line: 487]: Procedure Contract for changeMethaneLevel Derived contract for procedure changeMethaneLevel. Requires: ((((pumpRunning == 0) && (1 == systemActive)) && (1 <= waterLevel)) || ((2 <= waterLevel) && (1 == systemActive))) Ensures: ((((pumpRunning == 0) && (1 == systemActive)) && (1 <= waterLevel)) || ((2 <= waterLevel) && (1 == systemActive))) - ProcedureContractResult [Line: 707]: Procedure Contract for timeShift Derived contract for procedure timeShift. Requires: ((((pumpRunning == 0) && (1 == systemActive)) && (1 <= waterLevel)) || ((2 <= waterLevel) && (1 == systemActive))) Ensures: (((((1 == systemActive) && (\old(pumpRunning) == 0)) || ((1 == systemActive) && (2 <= \old(waterLevel)))) && ((1 < waterLevel) || ((pumpRunning == 0) && (waterLevel == 1)))) && ((\old(pumpRunning) != 0) || (\old(waterLevel) == waterLevel))) - ProcedureContractResult [Line: 566]: Procedure Contract for cleanup Derived contract for procedure cleanup. Requires: 0 Ensures: 0 - ProcedureContractResult [Line: 739]: Procedure Contract for processEnvironment__wrappee__highWaterSensor Derived contract for procedure processEnvironment__wrappee__highWaterSensor. Requires: (((pumpRunning == 0) && (1 == systemActive)) && (1 <= waterLevel)) Ensures: ((((1 == systemActive) && (\old(pumpRunning) == 0)) && ((waterLevel != 1) || (pumpRunning == 0))) && (1 <= waterLevel)) - ProcedureContractResult [Line: 475]: Procedure Contract for waterRise Derived contract for procedure waterRise. Requires: ((((pumpRunning == 0) && (1 == systemActive)) && (1 <= waterLevel)) || ((2 <= waterLevel) && (1 == systemActive))) Ensures: (((((\old(waterLevel) < 2) || (\old(waterLevel) == waterLevel)) && (2 <= waterLevel)) && (1 == systemActive)) && ((1 < \old(waterLevel)) || ((pumpRunning == 0) && (\old(waterLevel) == 1)))) RESULT: Ultimate proved your program to be correct! [2024-10-12 19:42:18,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE