./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec5_product36.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/product-lines/minepump_spec5_product36.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 06101f936f6436bac89af152aefce31c84cfc20ba80a5adfcf1af02faa2d4f3b --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 15:16:45,393 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 15:16:45,490 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 15:16:45,498 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 15:16:45,504 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 15:16:45,538 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 15:16:45,543 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 15:16:45,543 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 15:16:45,544 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 15:16:45,544 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 15:16:45,545 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 15:16:45,545 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 15:16:45,549 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 15:16:45,549 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 15:16:45,550 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 15:16:45,563 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 15:16:45,563 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 15:16:45,563 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 15:16:45,564 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 15:16:45,564 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 15:16:45,564 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 15:16:45,569 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 15:16:45,569 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 15:16:45,569 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 15:16:45,569 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 15:16:45,570 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 15:16:45,570 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 15:16:45,570 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 15:16:45,570 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 15:16:45,570 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 15:16:45,570 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 15:16:45,570 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 15:16:45,571 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:16:45,571 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 15:16:45,571 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 15:16:45,571 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 15:16:45,571 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 15:16:45,571 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 15:16:45,571 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 15:16:45,571 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 15:16:45,572 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 15:16:45,576 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 15:16:45,576 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 -> 06101f936f6436bac89af152aefce31c84cfc20ba80a5adfcf1af02faa2d4f3b [2024-11-08 15:16:45,933 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 15:16:45,961 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 15:16:45,966 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 15:16:45,969 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 15:16:45,972 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 15:16:45,973 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec5_product36.cil.c [2024-11-08 15:16:47,235 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 15:16:47,452 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 15:16:47,453 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec5_product36.cil.c [2024-11-08 15:16:47,467 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a74cf828/cc4bc404707a46c5a7f56d8efb5cc46c/FLAGd0d95360b [2024-11-08 15:16:47,482 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a74cf828/cc4bc404707a46c5a7f56d8efb5cc46c [2024-11-08 15:16:47,484 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 15:16:47,485 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 15:16:47,487 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 15:16:47,488 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 15:16:47,492 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 15:16:47,493 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:16:47" (1/1) ... [2024-11-08 15:16:47,495 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e620bcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:16:47, skipping insertion in model container [2024-11-08 15:16:47,495 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:16:47" (1/1) ... [2024-11-08 15:16:47,531 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 15:16:47,702 WARN L250 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_spec5_product36.cil.c[2141,2154] [2024-11-08 15:16:47,803 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:16:47,813 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 15:16:47,820 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [49] [2024-11-08 15:16:47,821 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [87] [2024-11-08 15:16:47,821 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [96] [2024-11-08 15:16:47,822 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [287] [2024-11-08 15:16:47,822 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [653] [2024-11-08 15:16:47,822 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [725] [2024-11-08 15:16:47,822 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification5_spec.i","") [823] [2024-11-08 15:16:47,822 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [873] [2024-11-08 15:16:47,829 WARN L250 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_spec5_product36.cil.c[2141,2154] [2024-11-08 15:16:47,904 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:16:47,931 INFO L204 MainTranslator]: Completed translation [2024-11-08 15:16:47,932 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:16:47 WrapperNode [2024-11-08 15:16:47,932 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 15:16:47,933 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 15:16:47,933 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 15:16:47,933 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 15:16:47,951 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:16:47" (1/1) ... [2024-11-08 15:16:47,963 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:16:47" (1/1) ... [2024-11-08 15:16:47,997 INFO L138 Inliner]: procedures = 56, calls = 99, calls flagged for inlining = 25, calls inlined = 21, statements flattened = 185 [2024-11-08 15:16:47,999 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 15:16:47,999 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 15:16:47,999 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 15:16:47,999 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 15:16:48,008 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:16:47" (1/1) ... [2024-11-08 15:16:48,008 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:16:47" (1/1) ... [2024-11-08 15:16:48,011 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:16:47" (1/1) ... [2024-11-08 15:16:48,033 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-11-08 15:16:48,033 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:16:47" (1/1) ... [2024-11-08 15:16:48,034 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:16:47" (1/1) ... [2024-11-08 15:16:48,041 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:16:47" (1/1) ... [2024-11-08 15:16:48,049 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:16:47" (1/1) ... [2024-11-08 15:16:48,052 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:16:47" (1/1) ... [2024-11-08 15:16:48,054 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:16:47" (1/1) ... [2024-11-08 15:16:48,055 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 15:16:48,060 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 15:16:48,060 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 15:16:48,060 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 15:16:48,061 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:16:47" (1/1) ... [2024-11-08 15:16:48,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:16:48,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:16:48,092 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-11-08 15:16:48,098 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-11-08 15:16:48,136 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 15:16:48,137 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-11-08 15:16:48,137 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-11-08 15:16:48,137 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-08 15:16:48,137 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-08 15:16:48,138 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-08 15:16:48,138 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-08 15:16:48,138 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-11-08 15:16:48,138 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-11-08 15:16:48,138 INFO L130 BoogieDeclarations]: Found specification of procedure isPumpRunning [2024-11-08 15:16:48,138 INFO L138 BoogieDeclarations]: Found implementation of procedure isPumpRunning [2024-11-08 15:16:48,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 15:16:48,139 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-11-08 15:16:48,139 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-11-08 15:16:48,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 15:16:48,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 15:16:48,193 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 15:16:48,195 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 15:16:48,362 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2024-11-08 15:16:48,362 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 15:16:48,372 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 15:16:48,375 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-08 15:16:48,375 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:16:48 BoogieIcfgContainer [2024-11-08 15:16:48,375 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 15:16:48,377 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 15:16:48,377 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 15:16:48,379 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 15:16:48,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 03:16:47" (1/3) ... [2024-11-08 15:16:48,380 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@445e39b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:16:48, skipping insertion in model container [2024-11-08 15:16:48,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:16:47" (2/3) ... [2024-11-08 15:16:48,380 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@445e39b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:16:48, skipping insertion in model container [2024-11-08 15:16:48,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:16:48" (3/3) ... [2024-11-08 15:16:48,381 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec5_product36.cil.c [2024-11-08 15:16:48,393 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 15:16:48,393 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 15:16:48,436 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 15:16:48,441 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;@229acd4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 15:16:48,441 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 15:16:48,444 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 67 states have (on average 1.373134328358209) internal successors, (92), 73 states have internal predecessors, (92), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-08 15:16:48,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-08 15:16:48,451 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:16:48,452 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:16:48,452 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:16:48,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:16:48,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1797931529, now seen corresponding path program 1 times [2024-11-08 15:16:48,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:16:48,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894502360] [2024-11-08 15:16:48,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:16:48,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:16:48,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:48,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-08 15:16:48,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:48,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-08 15:16:48,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:48,645 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 15:16:48,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:16:48,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894502360] [2024-11-08 15:16:48,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894502360] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:16:48,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:16:48,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 15:16:48,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431927012] [2024-11-08 15:16:48,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:16:48,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 15:16:48,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:16:48,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 15:16:48,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 15:16:48,697 INFO L87 Difference]: Start difference. First operand has 85 states, 67 states have (on average 1.373134328358209) internal successors, (92), 73 states have internal predecessors, (92), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 15:16:48,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:16:48,715 INFO L93 Difference]: Finished difference Result 161 states and 218 transitions. [2024-11-08 15:16:48,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 15:16:48,717 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2024-11-08 15:16:48,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:16:48,722 INFO L225 Difference]: With dead ends: 161 [2024-11-08 15:16:48,723 INFO L226 Difference]: Without dead ends: 76 [2024-11-08 15:16:48,725 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 6 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-11-08 15:16:48,728 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:16:48,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:16:48,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-08 15:16:48,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-11-08 15:16:48,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 60 states have (on average 1.3) internal successors, (78), 65 states have internal predecessors, (78), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 15:16:48,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 97 transitions. [2024-11-08 15:16:48,769 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 97 transitions. Word has length 32 [2024-11-08 15:16:48,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:16:48,771 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 97 transitions. [2024-11-08 15:16:48,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 15:16:48,772 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 97 transitions. [2024-11-08 15:16:48,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-08 15:16:48,773 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:16:48,774 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:16:48,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 15:16:48,774 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:16:48,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:16:48,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1521544977, now seen corresponding path program 1 times [2024-11-08 15:16:48,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:16:48,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058277513] [2024-11-08 15:16:48,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:16:48,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:16:48,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:48,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 15:16:48,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:48,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:16:48,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:48,887 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 15:16:48,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:16:48,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058277513] [2024-11-08 15:16:48,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058277513] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:16:48,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:16:48,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:16:48,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054002125] [2024-11-08 15:16:48,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:16:48,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:16:48,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:16:48,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:16:48,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:16:48,890 INFO L87 Difference]: Start difference. First operand 76 states and 97 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 15:16:48,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:16:48,913 INFO L93 Difference]: Finished difference Result 112 states and 143 transitions. [2024-11-08 15:16:48,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:16:48,914 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2024-11-08 15:16:48,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:16:48,914 INFO L225 Difference]: With dead ends: 112 [2024-11-08 15:16:48,914 INFO L226 Difference]: Without dead ends: 67 [2024-11-08 15:16:48,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:16:48,917 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 18 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:16:48,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 146 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:16:48,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-08 15:16:48,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-11-08 15:16:48,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 54 states have (on average 1.3148148148148149) internal successors, (71), 59 states have internal predecessors, (71), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-08 15:16:48,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 85 transitions. [2024-11-08 15:16:48,927 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 85 transitions. Word has length 33 [2024-11-08 15:16:48,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:16:48,927 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 85 transitions. [2024-11-08 15:16:48,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 15:16:48,927 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 85 transitions. [2024-11-08 15:16:48,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-08 15:16:48,928 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:16:48,928 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:16:48,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 15:16:48,931 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:16:48,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:16:48,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1250979301, now seen corresponding path program 1 times [2024-11-08 15:16:48,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:16:48,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542658880] [2024-11-08 15:16:48,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:16:48,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:16:48,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:49,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 15:16:49,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:49,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 15:16:49,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:49,041 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 15:16:49,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:16:49,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542658880] [2024-11-08 15:16:49,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542658880] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:16:49,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:16:49,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:16:49,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702837483] [2024-11-08 15:16:49,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:16:49,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:16:49,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:16:49,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:16:49,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:16:49,043 INFO L87 Difference]: Start difference. First operand 67 states and 85 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 15:16:49,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:16:49,076 INFO L93 Difference]: Finished difference Result 183 states and 238 transitions. [2024-11-08 15:16:49,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:16:49,077 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (3), 2 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 38 [2024-11-08 15:16:49,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:16:49,078 INFO L225 Difference]: With dead ends: 183 [2024-11-08 15:16:49,079 INFO L226 Difference]: Without dead ends: 124 [2024-11-08 15:16:49,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-11-08 15:16:49,080 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 58 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:16:49,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 171 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:16:49,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-08 15:16:49,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 119. [2024-11-08 15:16:49,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 94 states have (on average 1.3404255319148937) internal successors, (126), 103 states have internal predecessors, (126), 14 states have call successors, (14), 10 states have call predecessors, (14), 10 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-08 15:16:49,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 154 transitions. [2024-11-08 15:16:49,096 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 154 transitions. Word has length 38 [2024-11-08 15:16:49,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:16:49,096 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 154 transitions. [2024-11-08 15:16:49,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 15:16:49,097 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 154 transitions. [2024-11-08 15:16:49,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-08 15:16:49,099 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:16:49,099 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:16:49,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 15:16:49,102 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:16:49,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:16:49,103 INFO L85 PathProgramCache]: Analyzing trace with hash 177136733, now seen corresponding path program 1 times [2024-11-08 15:16:49,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:16:49,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69412213] [2024-11-08 15:16:49,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:16:49,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:16:49,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:49,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 15:16:49,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:49,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 15:16:49,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:49,252 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 15:16:49,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:16:49,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69412213] [2024-11-08 15:16:49,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69412213] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:16:49,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:16:49,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 15:16:49,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767645782] [2024-11-08 15:16:49,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:16:49,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 15:16:49,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:16:49,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 15:16:49,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 15:16:49,255 INFO L87 Difference]: Start difference. First operand 119 states and 154 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 15:16:49,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:16:49,377 INFO L93 Difference]: Finished difference Result 312 states and 412 transitions. [2024-11-08 15:16:49,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 15:16:49,378 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2024-11-08 15:16:49,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:16:49,381 INFO L225 Difference]: With dead ends: 312 [2024-11-08 15:16:49,383 INFO L226 Difference]: Without dead ends: 201 [2024-11-08 15:16:49,384 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 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-11-08 15:16:49,384 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 64 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:16:49,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 357 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:16:49,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-08 15:16:49,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2024-11-08 15:16:49,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 156 states have (on average 1.3012820512820513) internal successors, (203), 167 states have internal predecessors, (203), 24 states have call successors, (24), 20 states have call predecessors, (24), 20 states have return successors, (28), 24 states have call predecessors, (28), 24 states have call successors, (28) [2024-11-08 15:16:49,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 255 transitions. [2024-11-08 15:16:49,409 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 255 transitions. Word has length 41 [2024-11-08 15:16:49,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:16:49,410 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 255 transitions. [2024-11-08 15:16:49,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 15:16:49,410 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 255 transitions. [2024-11-08 15:16:49,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-08 15:16:49,411 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:16:49,411 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:16:49,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 15:16:49,412 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:16:49,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:16:49,412 INFO L85 PathProgramCache]: Analyzing trace with hash -413128686, now seen corresponding path program 1 times [2024-11-08 15:16:49,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:16:49,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802685868] [2024-11-08 15:16:49,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:16:49,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:16:49,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:49,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 15:16:49,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:49,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 15:16:49,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:49,479 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 15:16:49,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:16:49,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802685868] [2024-11-08 15:16:49,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802685868] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:16:49,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:16:49,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:16:49,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315864155] [2024-11-08 15:16:49,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:16:49,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:16:49,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:16:49,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:16:49,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:16:49,496 INFO L87 Difference]: Start difference. First operand 201 states and 255 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 15:16:49,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:16:49,571 INFO L93 Difference]: Finished difference Result 400 states and 514 transitions. [2024-11-08 15:16:49,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:16:49,575 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (3), 1 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 47 [2024-11-08 15:16:49,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:16:49,579 INFO L225 Difference]: With dead ends: 400 [2024-11-08 15:16:49,582 INFO L226 Difference]: Without dead ends: 207 [2024-11-08 15:16:49,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:16:49,587 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:16:49,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 321 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:16:49,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-11-08 15:16:49,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2024-11-08 15:16:49,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 162 states have (on average 1.2901234567901234) internal successors, (209), 173 states have internal predecessors, (209), 24 states have call successors, (24), 20 states have call predecessors, (24), 20 states have return successors, (28), 24 states have call predecessors, (28), 24 states have call successors, (28) [2024-11-08 15:16:49,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 261 transitions. [2024-11-08 15:16:49,632 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 261 transitions. Word has length 47 [2024-11-08 15:16:49,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:16:49,633 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 261 transitions. [2024-11-08 15:16:49,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 15:16:49,636 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 261 transitions. [2024-11-08 15:16:49,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-08 15:16:49,637 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:16:49,637 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:16:49,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 15:16:49,638 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:16:49,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:16:49,638 INFO L85 PathProgramCache]: Analyzing trace with hash -2001476588, now seen corresponding path program 1 times [2024-11-08 15:16:49,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:16:49,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222417031] [2024-11-08 15:16:49,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:16:49,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:16:49,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:49,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 15:16:49,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:49,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 15:16:49,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:49,710 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 15:16:49,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:16:49,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222417031] [2024-11-08 15:16:49,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222417031] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:16:49,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:16:49,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:16:49,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714885754] [2024-11-08 15:16:49,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:16:49,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:16:49,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:16:49,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:16:49,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:16:49,712 INFO L87 Difference]: Start difference. First operand 207 states and 261 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 15:16:49,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:16:49,758 INFO L93 Difference]: Finished difference Result 410 states and 528 transitions. [2024-11-08 15:16:49,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:16:49,758 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (3), 1 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 47 [2024-11-08 15:16:49,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:16:49,759 INFO L225 Difference]: With dead ends: 410 [2024-11-08 15:16:49,760 INFO L226 Difference]: Without dead ends: 211 [2024-11-08 15:16:49,760 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:16:49,761 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 0 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:16:49,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 243 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:16:49,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-08 15:16:49,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2024-11-08 15:16:49,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 166 states have (on average 1.283132530120482) internal successors, (213), 177 states have internal predecessors, (213), 24 states have call successors, (24), 20 states have call predecessors, (24), 20 states have return successors, (28), 24 states have call predecessors, (28), 24 states have call successors, (28) [2024-11-08 15:16:49,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 265 transitions. [2024-11-08 15:16:49,782 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 265 transitions. Word has length 47 [2024-11-08 15:16:49,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:16:49,782 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 265 transitions. [2024-11-08 15:16:49,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 15:16:49,782 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 265 transitions. [2024-11-08 15:16:49,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-08 15:16:49,787 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:16:49,787 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:16:49,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 15:16:49,787 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:16:49,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:16:49,788 INFO L85 PathProgramCache]: Analyzing trace with hash 604546966, now seen corresponding path program 1 times [2024-11-08 15:16:49,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:16:49,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303522923] [2024-11-08 15:16:49,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:16:49,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:16:49,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:49,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 15:16:49,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:49,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 15:16:49,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:49,885 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 15:16:49,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:16:49,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303522923] [2024-11-08 15:16:49,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303522923] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:16:49,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:16:49,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:16:49,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106307946] [2024-11-08 15:16:49,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:16:49,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:16:49,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:16:49,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:16:49,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:16:49,886 INFO L87 Difference]: Start difference. First operand 211 states and 265 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 15:16:49,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:16:49,911 INFO L93 Difference]: Finished difference Result 508 states and 643 transitions. [2024-11-08 15:16:49,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:16:49,912 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 2 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 47 [2024-11-08 15:16:49,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:16:49,913 INFO L225 Difference]: With dead ends: 508 [2024-11-08 15:16:49,914 INFO L226 Difference]: Without dead ends: 305 [2024-11-08 15:16:49,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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-11-08 15:16:49,915 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 39 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:16:49,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 155 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:16:49,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-11-08 15:16:49,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2024-11-08 15:16:49,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 240 states have (on average 1.25) internal successors, (300), 253 states have internal predecessors, (300), 36 states have call successors, (36), 30 states have call predecessors, (36), 28 states have return successors, (40), 34 states have call predecessors, (40), 36 states have call successors, (40) [2024-11-08 15:16:49,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 376 transitions. [2024-11-08 15:16:49,933 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 376 transitions. Word has length 47 [2024-11-08 15:16:49,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:16:49,934 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 376 transitions. [2024-11-08 15:16:49,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 15:16:49,934 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 376 transitions. [2024-11-08 15:16:49,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-08 15:16:49,936 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:16:49,936 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:16:49,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 15:16:49,936 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:16:49,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:16:49,937 INFO L85 PathProgramCache]: Analyzing trace with hash -542316420, now seen corresponding path program 1 times [2024-11-08 15:16:49,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:16:49,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841072462] [2024-11-08 15:16:49,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:16:49,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:16:49,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:50,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:16:50,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:50,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:16:50,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:50,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 15:16:50,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:50,105 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 15:16:50,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:16:50,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841072462] [2024-11-08 15:16:50,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841072462] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:16:50,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:16:50,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 15:16:50,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989541212] [2024-11-08 15:16:50,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:16:50,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 15:16:50,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:16:50,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 15:16:50,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-08 15:16:50,108 INFO L87 Difference]: Start difference. First operand 305 states and 376 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 15:16:50,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:16:50,367 INFO L93 Difference]: Finished difference Result 990 states and 1267 transitions. [2024-11-08 15:16:50,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 15:16:50,369 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 51 [2024-11-08 15:16:50,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:16:50,373 INFO L225 Difference]: With dead ends: 990 [2024-11-08 15:16:50,374 INFO L226 Difference]: Without dead ends: 787 [2024-11-08 15:16:50,375 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-08 15:16:50,376 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 208 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 15:16:50,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 614 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 15:16:50,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2024-11-08 15:16:50,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 771. [2024-11-08 15:16:50,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 771 states, 610 states have (on average 1.2327868852459016) internal successors, (752), 647 states have internal predecessors, (752), 88 states have call successors, (88), 66 states have call predecessors, (88), 72 states have return successors, (108), 84 states have call predecessors, (108), 88 states have call successors, (108) [2024-11-08 15:16:50,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 948 transitions. [2024-11-08 15:16:50,420 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 948 transitions. Word has length 51 [2024-11-08 15:16:50,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:16:50,421 INFO L471 AbstractCegarLoop]: Abstraction has 771 states and 948 transitions. [2024-11-08 15:16:50,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 15:16:50,421 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 948 transitions. [2024-11-08 15:16:50,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-08 15:16:50,423 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:16:50,423 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:16:50,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 15:16:50,423 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:16:50,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:16:50,423 INFO L85 PathProgramCache]: Analyzing trace with hash 8311452, now seen corresponding path program 1 times [2024-11-08 15:16:50,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:16:50,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851520060] [2024-11-08 15:16:50,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:16:50,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:16:50,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:50,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:16:50,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:50,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-08 15:16:50,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:50,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 15:16:50,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:50,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 15:16:50,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:50,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 15:16:50,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:50,516 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-08 15:16:50,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:16:50,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851520060] [2024-11-08 15:16:50,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851520060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:16:50,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:16:50,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 15:16:50,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790001539] [2024-11-08 15:16:50,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:16:50,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 15:16:50,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:16:50,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 15:16:50,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 15:16:50,518 INFO L87 Difference]: Start difference. First operand 771 states and 948 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-08 15:16:50,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:16:50,733 INFO L93 Difference]: Finished difference Result 1319 states and 1618 transitions. [2024-11-08 15:16:50,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 15:16:50,734 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 81 [2024-11-08 15:16:50,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:16:50,738 INFO L225 Difference]: With dead ends: 1319 [2024-11-08 15:16:50,738 INFO L226 Difference]: Without dead ends: 556 [2024-11-08 15:16:50,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-08 15:16:50,742 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 179 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:16:50,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 295 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:16:50,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2024-11-08 15:16:50,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 540. [2024-11-08 15:16:50,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 426 states have (on average 1.2183098591549295) internal successors, (519), 452 states have internal predecessors, (519), 62 states have call successors, (62), 48 states have call predecessors, (62), 51 states have return successors, (72), 59 states have call predecessors, (72), 62 states have call successors, (72) [2024-11-08 15:16:50,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 653 transitions. [2024-11-08 15:16:50,793 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 653 transitions. Word has length 81 [2024-11-08 15:16:50,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:16:50,794 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 653 transitions. [2024-11-08 15:16:50,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-08 15:16:50,794 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 653 transitions. [2024-11-08 15:16:50,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-08 15:16:50,795 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:16:50,795 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:16:50,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 15:16:50,796 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:16:50,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:16:50,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1954817075, now seen corresponding path program 1 times [2024-11-08 15:16:50,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:16:50,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453576778] [2024-11-08 15:16:50,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:16:50,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:16:50,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:50,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:16:50,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:50,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 15:16:50,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:50,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 15:16:50,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:50,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-08 15:16:50,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:50,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 15:16:50,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:50,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 15:16:50,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:50,964 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 15:16:50,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:16:50,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453576778] [2024-11-08 15:16:50,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453576778] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:16:50,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038733366] [2024-11-08 15:16:50,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:16:50,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:16:50,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:16:50,967 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-11-08 15:16:50,968 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-11-08 15:16:51,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:51,043 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 15:16:51,048 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:16:51,171 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:16:51,172 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:16:51,342 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 15:16:51,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038733366] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:16:51,343 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:16:51,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 14 [2024-11-08 15:16:51,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683680020] [2024-11-08 15:16:51,343 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:16:51,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 15:16:51,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:16:51,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 15:16:51,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-11-08 15:16:51,344 INFO L87 Difference]: Start difference. First operand 540 states and 653 transitions. Second operand has 14 states, 14 states have (on average 8.428571428571429) internal successors, (118), 10 states have internal predecessors, (118), 6 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (14), 8 states have call predecessors, (14), 6 states have call successors, (14) [2024-11-08 15:16:52,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:16:52,097 INFO L93 Difference]: Finished difference Result 1121 states and 1388 transitions. [2024-11-08 15:16:52,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-08 15:16:52,097 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 8.428571428571429) internal successors, (118), 10 states have internal predecessors, (118), 6 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (14), 8 states have call predecessors, (14), 6 states have call successors, (14) Word has length 83 [2024-11-08 15:16:52,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:16:52,102 INFO L225 Difference]: With dead ends: 1121 [2024-11-08 15:16:52,102 INFO L226 Difference]: Without dead ends: 668 [2024-11-08 15:16:52,103 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 178 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=393, Invalid=1499, Unknown=0, NotChecked=0, Total=1892 [2024-11-08 15:16:52,104 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 301 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 15:16:52,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 919 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 15:16:52,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2024-11-08 15:16:52,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 580. [2024-11-08 15:16:52,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 449 states have (on average 1.2026726057906458) internal successors, (540), 479 states have internal predecessors, (540), 71 states have call successors, (71), 60 states have call predecessors, (71), 59 states have return successors, (77), 62 states have call predecessors, (77), 71 states have call successors, (77) [2024-11-08 15:16:52,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 688 transitions. [2024-11-08 15:16:52,136 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 688 transitions. Word has length 83 [2024-11-08 15:16:52,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:16:52,137 INFO L471 AbstractCegarLoop]: Abstraction has 580 states and 688 transitions. [2024-11-08 15:16:52,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 8.428571428571429) internal successors, (118), 10 states have internal predecessors, (118), 6 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (14), 8 states have call predecessors, (14), 6 states have call successors, (14) [2024-11-08 15:16:52,137 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 688 transitions. [2024-11-08 15:16:52,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-08 15:16:52,142 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:16:52,143 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1] [2024-11-08 15:16:52,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 15:16:52,346 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,SelfDestructingSolverStorable9 [2024-11-08 15:16:52,347 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:16:52,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:16:52,348 INFO L85 PathProgramCache]: Analyzing trace with hash 57448184, now seen corresponding path program 1 times [2024-11-08 15:16:52,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:16:52,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346846627] [2024-11-08 15:16:52,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:16:52,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:16:52,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:52,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:16:52,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:52,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 15:16:52,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:52,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 15:16:52,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:52,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 15:16:52,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:52,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 15:16:52,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:52,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:16:52,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:52,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 15:16:52,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:52,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 15:16:52,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:52,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:16:52,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:52,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-08 15:16:52,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:52,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 15:16:52,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:52,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 15:16:52,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:52,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-08 15:16:52,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:52,535 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 94 proven. 6 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2024-11-08 15:16:52,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:16:52,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346846627] [2024-11-08 15:16:52,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346846627] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:16:52,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834156953] [2024-11-08 15:16:52,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:16:52,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:16:52,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:16:52,541 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-11-08 15:16:52,544 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-11-08 15:16:52,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:16:52,638 INFO L255 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-08 15:16:52,645 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:16:53,021 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 177 proven. 4 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-11-08 15:16:53,021 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:16:53,565 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 114 proven. 61 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-11-08 15:16:53,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [834156953] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:16:53,566 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:16:53,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 11] total 24 [2024-11-08 15:16:53,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710897366] [2024-11-08 15:16:53,566 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:16:53,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-08 15:16:53,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:16:53,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-08 15:16:53,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2024-11-08 15:16:53,568 INFO L87 Difference]: Start difference. First operand 580 states and 688 transitions. Second operand has 24 states, 24 states have (on average 9.041666666666666) internal successors, (217), 21 states have internal predecessors, (217), 9 states have call successors, (21), 8 states have call predecessors, (21), 9 states have return successors, (23), 8 states have call predecessors, (23), 9 states have call successors, (23) [2024-11-08 15:16:54,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:16:54,214 INFO L93 Difference]: Finished difference Result 1348 states and 1641 transitions. [2024-11-08 15:16:54,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-08 15:16:54,215 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 9.041666666666666) internal successors, (217), 21 states have internal predecessors, (217), 9 states have call successors, (21), 8 states have call predecessors, (21), 9 states have return successors, (23), 8 states have call predecessors, (23), 9 states have call successors, (23) Word has length 178 [2024-11-08 15:16:54,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:16:54,216 INFO L225 Difference]: With dead ends: 1348 [2024-11-08 15:16:54,216 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 15:16:54,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 370 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=332, Invalid=1228, Unknown=0, NotChecked=0, Total=1560 [2024-11-08 15:16:54,220 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 289 mSDsluCounter, 968 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 1080 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 15:16:54,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 1080 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 15:16:54,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 15:16:54,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 15:16:54,220 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-11-08 15:16:54,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 15:16:54,221 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 178 [2024-11-08 15:16:54,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:16:54,221 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 15:16:54,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 9.041666666666666) internal successors, (217), 21 states have internal predecessors, (217), 9 states have call successors, (21), 8 states have call predecessors, (21), 9 states have return successors, (23), 8 states have call predecessors, (23), 9 states have call successors, (23) [2024-11-08 15:16:54,221 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 15:16:54,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 15:16:54,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 15:16:54,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-08 15:16:54,424 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,SelfDestructingSolverStorable10 [2024-11-08 15:16:54,427 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:16:54,429 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 15:16:58,001 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 15:16:58,044 WARN L156 FloydHoareUtils]: Requires clause for timeShift contained old-variable. Original clause: (and (= ~pumpRunning~0 |old(~pumpRunning~0)|) (= ~switchedOnBeforeTS~0 |old(~switchedOnBeforeTS~0)|) (= |old(~waterLevel~0)| ~waterLevel~0) (let ((.cse1 (= 0 ~systemActive~0)) (.cse0 (= |old(~pumpRunning~0)| 0)) (.cse4 (<= |old(~waterLevel~0)| 1)) (.cse3 (= 1 ~systemActive~0)) (.cse5 (<= 1 |old(~pumpRunning~0)|)) (.cse2 (= |old(~waterLevel~0)| 2))) (or (and .cse0 .cse1 .cse2) (and .cse3 (<= 1 |old(~switchedOnBeforeTS~0)|) .cse4 .cse5) (and .cse0 .cse1 .cse4) (and .cse3 .cse0 .cse2) (and .cse3 .cse0 .cse4) (and .cse3 .cse5 .cse2)))) Eliminated clause: (let ((.cse5 (= 0 ~systemActive~0)) (.cse3 (= ~pumpRunning~0 0)) (.cse1 (= 2 ~waterLevel~0)) (.cse0 (<= 1 ~pumpRunning~0)) (.cse4 (<= ~waterLevel~0 1)) (.cse2 (= 1 ~systemActive~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5) (and .cse3 .cse1 .cse5) (and .cse3 .cse4 .cse2) (and .cse3 .cse1 .cse2) (and .cse0 .cse4 .cse2 (<= 1 ~switchedOnBeforeTS~0)))) [2024-11-08 15:16:58,067 WARN L156 FloydHoareUtils]: Requires clause for waterRise contained old-variable. Original clause: (and (let ((.cse1 (= 0 ~systemActive~0)) (.cse2 (= |old(~waterLevel~0)| 2)) (.cse0 (= ~pumpRunning~0 0)) (.cse5 (<= 1 ~pumpRunning~0)) (.cse3 (= 1 ~systemActive~0)) (.cse4 (<= |old(~waterLevel~0)| 1))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse2) (and .cse0 .cse1 .cse4) (and .cse5 .cse3 .cse2) (and .cse0 .cse3 .cse4) (and .cse5 .cse3 .cse4 (<= 1 ~switchedOnBeforeTS~0)))) (= |old(~waterLevel~0)| ~waterLevel~0)) Eliminated clause: (let ((.cse5 (= 0 ~systemActive~0)) (.cse3 (= ~pumpRunning~0 0)) (.cse1 (= 2 ~waterLevel~0)) (.cse0 (<= 1 ~pumpRunning~0)) (.cse4 (<= ~waterLevel~0 1)) (.cse2 (= 1 ~systemActive~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5) (and .cse3 .cse1 .cse5) (and .cse3 .cse4 .cse2) (and .cse3 .cse1 .cse2) (and .cse0 .cse4 .cse2 (<= 1 ~switchedOnBeforeTS~0)))) [2024-11-08 15:16:58,086 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 03:16:58 BoogieIcfgContainer [2024-11-08 15:16:58,088 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 15:16:58,088 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 15:16:58,089 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 15:16:58,089 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 15:16:58,089 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:16:48" (3/4) ... [2024-11-08 15:16:58,091 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 15:16:58,094 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base [2024-11-08 15:16:58,094 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2024-11-08 15:16:58,094 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure cleanup [2024-11-08 15:16:58,094 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure timeShift [2024-11-08 15:16:58,095 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure waterRise [2024-11-08 15:16:58,095 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure isPumpRunning [2024-11-08 15:16:58,099 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2024-11-08 15:16:58,100 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-08 15:16:58,100 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-08 15:16:58,100 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 15:16:58,101 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 15:16:58,198 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 15:16:58,198 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-08 15:16:58,198 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 15:16:58,199 INFO L158 Benchmark]: Toolchain (without parser) took 10713.33ms. Allocated memory was 142.6MB in the beginning and 262.1MB in the end (delta: 119.5MB). Free memory was 70.5MB in the beginning and 83.7MB in the end (delta: -13.2MB). Peak memory consumption was 108.5MB. Max. memory is 16.1GB. [2024-11-08 15:16:58,202 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 142.6MB. Free memory was 109.9MB in the beginning and 109.6MB in the end (delta: 243.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 15:16:58,202 INFO L158 Benchmark]: CACSL2BoogieTranslator took 445.37ms. Allocated memory was 142.6MB in the beginning and 178.3MB in the end (delta: 35.7MB). Free memory was 70.2MB in the beginning and 146.1MB in the end (delta: -75.8MB). Peak memory consumption was 28.6MB. Max. memory is 16.1GB. [2024-11-08 15:16:58,202 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.15ms. Allocated memory is still 178.3MB. Free memory was 146.0MB in the beginning and 147.8MB in the end (delta: -1.8MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. [2024-11-08 15:16:58,203 INFO L158 Benchmark]: Boogie Preprocessor took 59.69ms. Allocated memory is still 178.3MB. Free memory was 147.8MB in the beginning and 145.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 15:16:58,203 INFO L158 Benchmark]: RCFGBuilder took 315.55ms. Allocated memory is still 178.3MB. Free memory was 145.6MB in the beginning and 127.9MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-08 15:16:58,203 INFO L158 Benchmark]: TraceAbstraction took 9711.43ms. Allocated memory was 178.3MB in the beginning and 262.1MB in the end (delta: 83.9MB). Free memory was 126.9MB in the beginning and 91.0MB in the end (delta: 35.9MB). Peak memory consumption was 136.7MB. Max. memory is 16.1GB. [2024-11-08 15:16:58,203 INFO L158 Benchmark]: Witness Printer took 109.92ms. Allocated memory is still 262.1MB. Free memory was 91.0MB in the beginning and 83.7MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-08 15:16:58,205 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.09ms. Allocated memory is still 142.6MB. Free memory was 109.9MB in the beginning and 109.6MB in the end (delta: 243.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 445.37ms. Allocated memory was 142.6MB in the beginning and 178.3MB in the end (delta: 35.7MB). Free memory was 70.2MB in the beginning and 146.1MB in the end (delta: -75.8MB). Peak memory consumption was 28.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.15ms. Allocated memory is still 178.3MB. Free memory was 146.0MB in the beginning and 147.8MB in the end (delta: -1.8MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.69ms. Allocated memory is still 178.3MB. Free memory was 147.8MB in the beginning and 145.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 315.55ms. Allocated memory is still 178.3MB. Free memory was 145.6MB in the beginning and 127.9MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 9711.43ms. Allocated memory was 178.3MB in the beginning and 262.1MB in the end (delta: 83.9MB). Free memory was 126.9MB in the beginning and 91.0MB in the end (delta: 35.9MB). Peak memory consumption was 136.7MB. Max. memory is 16.1GB. * Witness Printer took 109.92ms. Allocated memory is still 262.1MB. Free memory was 91.0MB in the beginning and 83.7MB 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,"featureselect.i","") [49] - GenericResultAtLocation [Line: 87]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [87] - GenericResultAtLocation [Line: 96]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [96] - GenericResultAtLocation [Line: 287]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [287] - GenericResultAtLocation [Line: 653]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [653] - GenericResultAtLocation [Line: 725]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [725] - GenericResultAtLocation [Line: 823]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification5_spec.i","") [823] - GenericResultAtLocation [Line: 873]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [873] * 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: 92]: 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, 85 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.0s, OverallIterations: 11, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1184 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1156 mSDsluCounter, 4407 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3286 mSDsCounter, 293 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1638 IncrementalHoareTripleChecker+Invalid, 1931 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 293 mSolverCounterUnsat, 1121 mSDtfsCounter, 1638 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 731 GetRequests, 611 SyntacticMatches, 7 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 765 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=771occurred in iteration=8, InterpolantAutomatonStates: 102, 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, 11 MinimizatonAttempts, 125 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 939 NumberOfCodeBlocks, 939 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1185 ConstructedInterpolants, 0 QuantifiedInterpolants, 2376 SizeOfPredicates, 2 NumberOfNonLiveVariables, 806 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 15 InterpolantComputations, 9 PerfectInterpolantSequences, 860/961 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: 666]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 667]: Loop Invariant Derived loop invariant: (((((((((pumpRunning == 0) && (2 == waterLevel)) && (splverifierCounter == 0)) && (0 == systemActive)) || (((((1 <= pumpRunning) && (waterLevel <= 1)) && (1 == systemActive)) && (splverifierCounter == 0)) && (1 <= switchedOnBeforeTS))) || ((((pumpRunning == 0) && (waterLevel <= 1)) && (splverifierCounter == 0)) && (0 == systemActive))) || ((((pumpRunning == 0) && (2 == waterLevel)) && (1 == systemActive)) && (splverifierCounter == 0))) || ((((1 <= pumpRunning) && (2 == waterLevel)) && (1 == systemActive)) && (splverifierCounter == 0))) || ((((pumpRunning == 0) && (waterLevel <= 1)) && (1 == systemActive)) && (splverifierCounter == 0))) - InvariantResult [Line: 737]: Loop Invariant Derived loop invariant: 0 - ProcedureContractResult [Line: 140]: Procedure Contract for processEnvironment__wrappee__base Derived contract for procedure processEnvironment__wrappee__base. Requires: (((((pumpRunning == 0) && (waterLevel <= 1)) && (1 == systemActive)) || (((pumpRunning == 0) && (2 == waterLevel)) && (1 == systemActive))) || ((((1 <= pumpRunning) && (waterLevel <= 1)) && (1 == systemActive)) && (1 <= switchedOnBeforeTS))) Ensures: ((((((pumpRunning == 0) && (waterLevel <= 1)) && (1 == systemActive)) || (((pumpRunning == 0) && (2 == waterLevel)) && (1 == systemActive))) || ((((1 <= pumpRunning) && (waterLevel <= 1)) && (1 == systemActive)) && (1 <= switchedOnBeforeTS))) && (((((((pumpRunning == \old(pumpRunning)) && (systemActive == \old(systemActive))) && (head == \old(head))) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (switchedOnBeforeTS == \old(switchedOnBeforeTS))) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical)))) - ProcedureContractResult [Line: 900]: Procedure Contract for changeMethaneLevel Derived contract for procedure changeMethaneLevel. Requires: (((((((1 <= pumpRunning) && (2 == waterLevel)) && (1 == systemActive)) || ((((1 <= pumpRunning) && (1 == systemActive)) && (waterLevel <= 2)) && (1 <= switchedOnBeforeTS))) || (((pumpRunning == 0) && (waterLevel <= 1)) && (1 == systemActive))) || (((pumpRunning == 0) && (2 == waterLevel)) && (1 == systemActive))) || (((pumpRunning == 0) && (waterLevel <= 2)) && (0 == systemActive))) Ensures: ((((((((1 <= pumpRunning) && (2 == waterLevel)) && (1 == systemActive)) || ((((1 <= pumpRunning) && (1 == systemActive)) && (waterLevel <= 2)) && (1 <= switchedOnBeforeTS))) || (((pumpRunning == 0) && (waterLevel <= 1)) && (1 == systemActive))) || (((pumpRunning == 0) && (2 == waterLevel)) && (1 == systemActive))) || (((pumpRunning == 0) && (waterLevel <= 2)) && (0 == systemActive))) && ((((((pumpRunning == \old(pumpRunning)) && (systemActive == \old(systemActive))) && (head == \old(head))) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (switchedOnBeforeTS == \old(switchedOnBeforeTS))) && (waterLevel == \old(waterLevel)))) - ProcedureContractResult [Line: 727]: Procedure Contract for cleanup Derived contract for procedure cleanup. Requires: 0 Ensures: (0 && ((((systemActive == \old(systemActive)) && (head == \old(head))) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (methaneLevelCritical == \old(methaneLevelCritical)))) - ProcedureContractResult [Line: 113]: Procedure Contract for timeShift Derived contract for procedure timeShift. Requires: ((((((((1 <= pumpRunning) && (2 == waterLevel)) && (1 == systemActive)) || (((pumpRunning == 0) && (waterLevel <= 1)) && (0 == systemActive))) || (((pumpRunning == 0) && (2 == waterLevel)) && (0 == systemActive))) || (((pumpRunning == 0) && (waterLevel <= 1)) && (1 == systemActive))) || (((pumpRunning == 0) && (2 == waterLevel)) && (1 == systemActive))) || ((((1 <= pumpRunning) && (waterLevel <= 1)) && (1 == systemActive)) && (1 <= switchedOnBeforeTS))) Ensures: ((((((((((\old(waterLevel) != 1) || (\old(pumpRunning) < 1)) || ((((1 <= pumpRunning) && (1 == systemActive)) && (waterLevel <= 0)) && (1 <= switchedOnBeforeTS))) && (((((1 <= pumpRunning) && (\old(waterLevel) == waterLevel)) && (1 <= switchedOnBeforeTS)) || (\old(pumpRunning) < 1)) || (((((1 <= pumpRunning) && (waterLevel <= 1)) && (1 == systemActive)) && (((long long) waterLevel + 1) <= \old(waterLevel))) && (1 <= switchedOnBeforeTS)))) && ((((((((\old(pumpRunning) == 0) && (0 == systemActive)) && (\old(waterLevel) == 2)) || ((1 <= \old(pumpRunning)) && (\old(waterLevel) == 2))) || ((((1 == systemActive) && (1 <= \old(switchedOnBeforeTS))) && (\old(waterLevel) <= 1)) && (1 <= \old(pumpRunning)))) || (((\old(pumpRunning) == 0) && (0 == systemActive)) && (\old(waterLevel) <= 1))) || (((1 == systemActive) && (\old(pumpRunning) == 0)) && (\old(waterLevel) == 2))) || (((1 == systemActive) && (\old(pumpRunning) == 0)) && (\old(waterLevel) <= 1)))) && ((((\old(pumpRunning) != 0) || ((1 <= pumpRunning) && (2 == waterLevel))) || ((pumpRunning == 0) && (2 == waterLevel))) || (\old(waterLevel) != 2))) && ((((pumpRunning == 0) && (2 == waterLevel)) || (\old(waterLevel) != 2)) || (0 != systemActive))) && (((1 < \old(waterLevel)) || (\old(pumpRunning) != 0)) || ((pumpRunning == 0) && (\old(waterLevel) == waterLevel)))) && (((\old(waterLevel) != 2) || (\old(pumpRunning) < 1)) || (waterLevel == 1))) && ((((systemActive == \old(systemActive)) && (head == \old(head))) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (methaneLevelCritical == \old(methaneLevelCritical)))) - ProcedureContractResult [Line: 888]: Procedure Contract for waterRise Derived contract for procedure waterRise. Requires: ((((((((1 <= pumpRunning) && (2 == waterLevel)) && (1 == systemActive)) || (((pumpRunning == 0) && (waterLevel <= 1)) && (0 == systemActive))) || (((pumpRunning == 0) && (2 == waterLevel)) && (0 == systemActive))) || (((pumpRunning == 0) && (waterLevel <= 1)) && (1 == systemActive))) || (((pumpRunning == 0) && (2 == waterLevel)) && (1 == systemActive))) || ((((1 <= pumpRunning) && (waterLevel <= 1)) && (1 == systemActive)) && (1 <= switchedOnBeforeTS))) Ensures: (((((((((((((pumpRunning == 0) && (1 == systemActive)) && (\old(waterLevel) == 2)) || ((0 == systemActive) && (\old(waterLevel) == 2))) || (((1 <= pumpRunning) && (1 == systemActive)) && (\old(waterLevel) == 2))) || (((pumpRunning == 0) && (1 == systemActive)) && (\old(waterLevel) <= 1))) || ((((1 <= pumpRunning) && (1 == systemActive)) && (\old(waterLevel) <= 1)) && (1 <= switchedOnBeforeTS))) || ((0 == systemActive) && (\old(waterLevel) <= 1))) && ((2 == waterLevel) || (\old(waterLevel) != 2))) && ((2 == waterLevel) || (\old(waterLevel) != 1))) && ((((long long) \old(waterLevel) + 1) == waterLevel) || (\old(waterLevel) == waterLevel))) && ((pumpRunning == 0) || (0 != systemActive))) && ((((((pumpRunning == \old(pumpRunning)) && (systemActive == \old(systemActive))) && (head == \old(head))) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (switchedOnBeforeTS == \old(switchedOnBeforeTS))) && (methaneLevelCritical == \old(methaneLevelCritical)))) - ProcedureContractResult [Line: 200]: Procedure Contract for isPumpRunning Derived contract for procedure isPumpRunning. Requires: (((((((1 <= pumpRunning) && (2 == waterLevel)) && (1 == systemActive)) || ((((1 <= pumpRunning) && (1 == systemActive)) && (waterLevel <= 2)) && (1 <= switchedOnBeforeTS))) || (((pumpRunning == 0) && (waterLevel <= 1)) && (1 == systemActive))) || (((pumpRunning == 0) && (2 == waterLevel)) && (1 == systemActive))) || (((pumpRunning == 0) && (waterLevel <= 2)) && (0 == systemActive))) Ensures: (((((((((1 <= pumpRunning) && (2 == waterLevel)) && (1 == systemActive)) || ((((1 <= pumpRunning) && (1 == systemActive)) && (waterLevel <= 2)) && (1 <= switchedOnBeforeTS))) || (((pumpRunning == 0) && (waterLevel <= 1)) && (1 == systemActive))) || (((pumpRunning == 0) && (2 == waterLevel)) && (1 == systemActive))) || (((pumpRunning == 0) && (waterLevel <= 2)) && (0 == systemActive))) && (pumpRunning == \result)) && (((((((pumpRunning == \old(pumpRunning)) && (systemActive == \old(systemActive))) && (head == \old(head))) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (switchedOnBeforeTS == \old(switchedOnBeforeTS))) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical)))) RESULT: Ultimate proved your program to be correct! [2024-11-08 15:16:58,255 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