./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product59.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product59.cil.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 68cd47586ea836a40d34f69dc7bca714ffc0af5c5bf2f7fbd8cfbbd6f1019685 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 03:00:37,088 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 03:00:37,173 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 03:00:37,186 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 03:00:37,187 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 03:00:37,221 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 03:00:37,224 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 03:00:37,224 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 03:00:37,225 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 03:00:37,227 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 03:00:37,228 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 03:00:37,228 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 03:00:37,229 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 03:00:37,231 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 03:00:37,231 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 03:00:37,232 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 03:00:37,232 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 03:00:37,232 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 03:00:37,233 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 03:00:37,233 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 03:00:37,233 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 03:00:37,234 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 03:00:37,234 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 03:00:37,235 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 03:00:37,235 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 03:00:37,235 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 03:00:37,236 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 03:00:37,236 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 03:00:37,236 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 03:00:37,237 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 03:00:37,237 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 03:00:37,237 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 03:00:37,237 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:00:37,238 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 03:00:37,238 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 03:00:37,238 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 03:00:37,238 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 03:00:37,239 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 03:00:37,239 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 03:00:37,239 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 03:00:37,239 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 03:00:37,242 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 03:00:37,242 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-clean/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-clean/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 -> 68cd47586ea836a40d34f69dc7bca714ffc0af5c5bf2f7fbd8cfbbd6f1019685 [2024-10-11 03:00:37,533 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 03:00:37,560 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 03:00:37,564 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 03:00:37,565 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 03:00:37,565 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 03:00:37,567 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product59.cil.c [2024-10-11 03:00:39,064 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 03:00:39,302 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 03:00:39,303 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product59.cil.c [2024-10-11 03:00:39,321 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/865dc6b77/f90b788d32d64af29fb1db6a37934105/FLAGb70d1b6d7 [2024-10-11 03:00:39,336 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/865dc6b77/f90b788d32d64af29fb1db6a37934105 [2024-10-11 03:00:39,338 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 03:00:39,339 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 03:00:39,342 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 03:00:39,342 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 03:00:39,349 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 03:00:39,350 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:00:39" (1/1) ... [2024-10-11 03:00:39,351 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70f9f0d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:00:39, skipping insertion in model container [2024-10-11 03:00:39,351 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:00:39" (1/1) ... [2024-10-11 03:00:39,400 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 03:00:39,691 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product59.cil.c[9171,9184] [2024-10-11 03:00:39,763 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:00:39,782 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 03:00:39,793 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [49] [2024-10-11 03:00:39,795 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification4_spec.i","") [87] [2024-10-11 03:00:39,796 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [116] [2024-10-11 03:00:39,796 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [188] [2024-10-11 03:00:39,796 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [426] [2024-10-11 03:00:39,796 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [522] [2024-10-11 03:00:39,796 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [625] [2024-10-11 03:00:39,797 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [634] [2024-10-11 03:00:39,829 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product59.cil.c[9171,9184] [2024-10-11 03:00:39,874 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:00:39,896 INFO L204 MainTranslator]: Completed translation [2024-10-11 03:00:39,897 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:00:39 WrapperNode [2024-10-11 03:00:39,897 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 03:00:39,898 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 03:00:39,898 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 03:00:39,898 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 03:00:39,904 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:00:39" (1/1) ... [2024-10-11 03:00:39,925 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:00:39" (1/1) ... [2024-10-11 03:00:39,953 INFO L138 Inliner]: procedures = 57, calls = 102, calls flagged for inlining = 26, calls inlined = 23, statements flattened = 230 [2024-10-11 03:00:39,953 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 03:00:39,954 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 03:00:39,954 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 03:00:39,954 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 03:00:39,963 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:00:39" (1/1) ... [2024-10-11 03:00:39,963 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:00:39" (1/1) ... [2024-10-11 03:00:39,966 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:00:39" (1/1) ... [2024-10-11 03:00:39,984 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 03:00:39,984 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:00:39" (1/1) ... [2024-10-11 03:00:39,984 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:00:39" (1/1) ... [2024-10-11 03:00:39,989 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:00:39" (1/1) ... [2024-10-11 03:00:39,994 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:00:39" (1/1) ... [2024-10-11 03:00:39,995 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:00:39" (1/1) ... [2024-10-11 03:00:39,997 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:00:39" (1/1) ... [2024-10-11 03:00:40,000 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 03:00:40,001 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 03:00:40,001 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 03:00:40,001 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 03:00:40,005 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:00:39" (1/1) ... [2024-10-11 03:00:40,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:00:40,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:00:40,050 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 03:00:40,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 03:00:40,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 03:00:40,121 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-10-11 03:00:40,121 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-10-11 03:00:40,122 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-11 03:00:40,122 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-11 03:00:40,122 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-11 03:00:40,122 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-11 03:00:40,122 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2024-10-11 03:00:40,122 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2024-10-11 03:00:40,122 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-10-11 03:00:40,123 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-10-11 03:00:40,123 INFO L130 BoogieDeclarations]: Found specification of procedure deactivatePump [2024-10-11 03:00:40,123 INFO L138 BoogieDeclarations]: Found implementation of procedure deactivatePump [2024-10-11 03:00:40,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 03:00:40,124 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-10-11 03:00:40,124 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-10-11 03:00:40,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 03:00:40,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 03:00:40,216 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 03:00:40,218 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 03:00:40,571 INFO L? ?]: Removed 52 outVars from TransFormulas that were not future-live. [2024-10-11 03:00:40,571 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 03:00:40,645 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 03:00:40,645 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 03:00:40,649 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:00:40 BoogieIcfgContainer [2024-10-11 03:00:40,649 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 03:00:40,652 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 03:00:40,653 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 03:00:40,656 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 03:00:40,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:00:39" (1/3) ... [2024-10-11 03:00:40,658 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58f13cb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:00:40, skipping insertion in model container [2024-10-11 03:00:40,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:00:39" (2/3) ... [2024-10-11 03:00:40,658 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58f13cb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:00:40, skipping insertion in model container [2024-10-11 03:00:40,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:00:40" (3/3) ... [2024-10-11 03:00:40,660 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec4_product59.cil.c [2024-10-11 03:00:40,678 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 03:00:40,678 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 03:00:40,749 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 03:00:40,755 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;@1332720f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 03:00:40,755 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 03:00:40,761 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 50 states have (on average 1.56) internal successors, (78), 59 states have internal predecessors, (78), 12 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 03:00:40,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 03:00:40,769 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:00:40,769 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:00:40,770 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:00:40,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:00:40,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1515543352, now seen corresponding path program 1 times [2024-10-11 03:00:40,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:00:40,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315610946] [2024-10-11 03:00:40,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:00:40,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:00:40,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:41,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:00:41,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:00:41,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315610946] [2024-10-11 03:00:41,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315610946] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:00:41,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:00:41,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 03:00:41,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965199404] [2024-10-11 03:00:41,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:00:41,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 03:00:41,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:00:41,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 03:00:41,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 03:00:41,049 INFO L87 Difference]: Start difference. First operand has 71 states, 50 states have (on average 1.56) internal successors, (78), 59 states have internal predecessors, (78), 12 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:00:41,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:00:41,119 INFO L93 Difference]: Finished difference Result 140 states and 205 transitions. [2024-10-11 03:00:41,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 03:00:41,123 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-11 03:00:41,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:00:41,136 INFO L225 Difference]: With dead ends: 140 [2024-10-11 03:00:41,136 INFO L226 Difference]: Without dead ends: 66 [2024-10-11 03:00:41,140 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 03:00:41,143 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:00:41,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:00:41,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-11 03:00:41,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-10-11 03:00:41,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 47 states have (on average 1.446808510638298) internal successors, (68), 55 states have internal predecessors, (68), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 03:00:41,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 91 transitions. [2024-10-11 03:00:41,188 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 91 transitions. Word has length 12 [2024-10-11 03:00:41,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:00:41,189 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 91 transitions. [2024-10-11 03:00:41,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:00:41,189 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 91 transitions. [2024-10-11 03:00:41,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 03:00:41,191 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:00:41,191 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:00:41,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 03:00:41,191 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:00:41,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:00:41,192 INFO L85 PathProgramCache]: Analyzing trace with hash -411182921, now seen corresponding path program 1 times [2024-10-11 03:00:41,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:00:41,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691653714] [2024-10-11 03:00:41,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:00:41,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:00:41,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:41,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:00:41,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:00:41,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691653714] [2024-10-11 03:00:41,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691653714] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:00:41,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:00:41,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:00:41,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695701750] [2024-10-11 03:00:41,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:00:41,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:00:41,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:00:41,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:00:41,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:00:41,322 INFO L87 Difference]: Start difference. First operand 66 states and 91 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:00:41,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:00:41,377 INFO L93 Difference]: Finished difference Result 102 states and 140 transitions. [2024-10-11 03:00:41,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:00:41,378 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-11 03:00:41,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:00:41,379 INFO L225 Difference]: With dead ends: 102 [2024-10-11 03:00:41,379 INFO L226 Difference]: Without dead ends: 58 [2024-10-11 03:00:41,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:00:41,381 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 14 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:00:41,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 117 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:00:41,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-10-11 03:00:41,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-10-11 03:00:41,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 42 states have (on average 1.4761904761904763) internal successors, (62), 50 states have internal predecessors, (62), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 03:00:41,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 80 transitions. [2024-10-11 03:00:41,393 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 80 transitions. Word has length 13 [2024-10-11 03:00:41,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:00:41,393 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 80 transitions. [2024-10-11 03:00:41,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:00:41,393 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 80 transitions. [2024-10-11 03:00:41,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 03:00:41,394 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:00:41,394 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:00:41,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 03:00:41,395 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:00:41,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:00:41,396 INFO L85 PathProgramCache]: Analyzing trace with hash -664998067, now seen corresponding path program 1 times [2024-10-11 03:00:41,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:00:41,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078594581] [2024-10-11 03:00:41,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:00:41,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:00:41,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:41,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:00:41,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:00:41,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078594581] [2024-10-11 03:00:41,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078594581] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:00:41,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:00:41,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 03:00:41,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982969393] [2024-10-11 03:00:41,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:00:41,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:00:41,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:00:41,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:00:41,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:00:41,511 INFO L87 Difference]: Start difference. First operand 58 states and 80 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:00:41,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:00:41,579 INFO L93 Difference]: Finished difference Result 170 states and 237 transitions. [2024-10-11 03:00:41,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:00:41,583 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-11 03:00:41,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:00:41,585 INFO L225 Difference]: With dead ends: 170 [2024-10-11 03:00:41,585 INFO L226 Difference]: Without dead ends: 114 [2024-10-11 03:00:41,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:00:41,587 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 67 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:00:41,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 137 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:00:41,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-11 03:00:41,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2024-10-11 03:00:41,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 80 states have (on average 1.4875) internal successors, (119), 95 states have internal predecessors, (119), 18 states have call successors, (18), 12 states have call predecessors, (18), 12 states have return successors, (18), 11 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 03:00:41,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 155 transitions. [2024-10-11 03:00:41,618 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 155 transitions. Word has length 16 [2024-10-11 03:00:41,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:00:41,618 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 155 transitions. [2024-10-11 03:00:41,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:00:41,619 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 155 transitions. [2024-10-11 03:00:41,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 03:00:41,620 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:00:41,620 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:00:41,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 03:00:41,621 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:00:41,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:00:41,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1974418760, now seen corresponding path program 1 times [2024-10-11 03:00:41,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:00:41,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078124544] [2024-10-11 03:00:41,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:00:41,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:00:41,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:41,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:00:41,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:00:41,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078124544] [2024-10-11 03:00:41,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078124544] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:00:41,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:00:41,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:00:41,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628979675] [2024-10-11 03:00:41,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:00:41,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:00:41,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:00:41,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:00:41,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:00:41,804 INFO L87 Difference]: Start difference. First operand 111 states and 155 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:00:41,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:00:41,923 INFO L93 Difference]: Finished difference Result 319 states and 462 transitions. [2024-10-11 03:00:41,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:00:41,924 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-10-11 03:00:41,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:00:41,928 INFO L225 Difference]: With dead ends: 319 [2024-10-11 03:00:41,929 INFO L226 Difference]: Without dead ends: 210 [2024-10-11 03:00:41,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:00:41,933 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 53 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:00:41,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 187 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:00:41,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-10-11 03:00:41,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2024-10-11 03:00:41,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 151 states have (on average 1.4503311258278146) internal successors, (219), 178 states have internal predecessors, (219), 36 states have call successors, (36), 24 states have call predecessors, (36), 22 states have return successors, (38), 20 states have call predecessors, (38), 36 states have call successors, (38) [2024-10-11 03:00:41,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 293 transitions. [2024-10-11 03:00:41,966 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 293 transitions. Word has length 19 [2024-10-11 03:00:41,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:00:41,966 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 293 transitions. [2024-10-11 03:00:41,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:00:41,967 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 293 transitions. [2024-10-11 03:00:41,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 03:00:41,969 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:00:41,969 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:00:41,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 03:00:41,969 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:00:41,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:00:41,970 INFO L85 PathProgramCache]: Analyzing trace with hash 570910653, now seen corresponding path program 1 times [2024-10-11 03:00:41,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:00:41,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089224787] [2024-10-11 03:00:41,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:00:41,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:00:41,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:42,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:00:42,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:00:42,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089224787] [2024-10-11 03:00:42,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089224787] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:00:42,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:00:42,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:00:42,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468181361] [2024-10-11 03:00:42,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:00:42,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:00:42,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:00:42,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:00:42,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:00:42,106 INFO L87 Difference]: Start difference. First operand 210 states and 293 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:00:42,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:00:42,199 INFO L93 Difference]: Finished difference Result 524 states and 747 transitions. [2024-10-11 03:00:42,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:00:42,201 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-10-11 03:00:42,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:00:42,204 INFO L225 Difference]: With dead ends: 524 [2024-10-11 03:00:42,206 INFO L226 Difference]: Without dead ends: 316 [2024-10-11 03:00:42,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:00:42,209 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 45 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:00:42,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 181 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:00:42,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2024-10-11 03:00:42,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 310. [2024-10-11 03:00:42,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 231 states have (on average 1.3636363636363635) internal successors, (315), 255 states have internal predecessors, (315), 41 states have call successors, (41), 39 states have call predecessors, (41), 37 states have return successors, (59), 36 states have call predecessors, (59), 41 states have call successors, (59) [2024-10-11 03:00:42,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 415 transitions. [2024-10-11 03:00:42,263 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 415 transitions. Word has length 21 [2024-10-11 03:00:42,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:00:42,263 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 415 transitions. [2024-10-11 03:00:42,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:00:42,265 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 415 transitions. [2024-10-11 03:00:42,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 03:00:42,269 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:00:42,269 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:00:42,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 03:00:42,270 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:00:42,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:00:42,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1739101113, now seen corresponding path program 1 times [2024-10-11 03:00:42,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:00:42,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409233602] [2024-10-11 03:00:42,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:00:42,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:00:42,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:42,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 03:00:42,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:42,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 03:00:42,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:42,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:00:42,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:00:42,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409233602] [2024-10-11 03:00:42,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409233602] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:00:42,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:00:42,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:00:42,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33167124] [2024-10-11 03:00:42,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:00:42,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:00:42,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:00:42,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:00:42,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:00:42,398 INFO L87 Difference]: Start difference. First operand 310 states and 415 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 03:00:42,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:00:42,877 INFO L93 Difference]: Finished difference Result 746 states and 1033 transitions. [2024-10-11 03:00:42,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:00:42,878 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (3), 3 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 34 [2024-10-11 03:00:42,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:00:42,881 INFO L225 Difference]: With dead ends: 746 [2024-10-11 03:00:42,881 INFO L226 Difference]: Without dead ends: 438 [2024-10-11 03:00:42,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:00:42,883 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 259 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:00:42,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 255 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:00:42,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2024-10-11 03:00:42,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 392. [2024-10-11 03:00:42,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 293 states have (on average 1.3447098976109215) internal successors, (394), 327 states have internal predecessors, (394), 47 states have call successors, (47), 39 states have call predecessors, (47), 51 states have return successors, (85), 44 states have call predecessors, (85), 47 states have call successors, (85) [2024-10-11 03:00:42,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 526 transitions. [2024-10-11 03:00:42,934 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 526 transitions. Word has length 34 [2024-10-11 03:00:42,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:00:42,934 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 526 transitions. [2024-10-11 03:00:42,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 03:00:42,935 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 526 transitions. [2024-10-11 03:00:42,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 03:00:42,936 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:00:42,936 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:00:42,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 03:00:42,937 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:00:42,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:00:42,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1480935675, now seen corresponding path program 1 times [2024-10-11 03:00:42,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:00:42,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620249438] [2024-10-11 03:00:42,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:00:42,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:00:42,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:42,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 03:00:42,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:42,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 03:00:42,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:43,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:00:43,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:00:43,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620249438] [2024-10-11 03:00:43,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620249438] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:00:43,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:00:43,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:00:43,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890413850] [2024-10-11 03:00:43,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:00:43,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:00:43,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:00:43,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:00:43,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:00:43,021 INFO L87 Difference]: Start difference. First operand 392 states and 526 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 03:00:43,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:00:43,267 INFO L93 Difference]: Finished difference Result 758 states and 1042 transitions. [2024-10-11 03:00:43,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:00:43,267 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2024-10-11 03:00:43,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:00:43,270 INFO L225 Difference]: With dead ends: 758 [2024-10-11 03:00:43,270 INFO L226 Difference]: Without dead ends: 368 [2024-10-11 03:00:43,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-11 03:00:43,278 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 106 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:00:43,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 178 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:00:43,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2024-10-11 03:00:43,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 308. [2024-10-11 03:00:43,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 231 states have (on average 1.3376623376623376) internal successors, (309), 256 states have internal predecessors, (309), 38 states have call successors, (38), 32 states have call predecessors, (38), 38 states have return successors, (60), 33 states have call predecessors, (60), 38 states have call successors, (60) [2024-10-11 03:00:43,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 407 transitions. [2024-10-11 03:00:43,317 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 407 transitions. Word has length 34 [2024-10-11 03:00:43,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:00:43,318 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 407 transitions. [2024-10-11 03:00:43,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 03:00:43,319 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 407 transitions. [2024-10-11 03:00:43,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 03:00:43,320 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:00:43,321 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:00:43,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 03:00:43,321 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:00:43,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:00:43,322 INFO L85 PathProgramCache]: Analyzing trace with hash 727983863, now seen corresponding path program 1 times [2024-10-11 03:00:43,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:00:43,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072609247] [2024-10-11 03:00:43,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:00:43,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:00:43,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:43,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 03:00:43,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:43,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 03:00:43,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:43,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:00:43,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:00:43,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072609247] [2024-10-11 03:00:43,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072609247] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:00:43,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:00:43,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:00:43,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755985826] [2024-10-11 03:00:43,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:00:43,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:00:43,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:00:43,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:00:43,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:00:43,404 INFO L87 Difference]: Start difference. First operand 308 states and 407 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 03:00:43,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:00:43,783 INFO L93 Difference]: Finished difference Result 714 states and 1009 transitions. [2024-10-11 03:00:43,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:00:43,784 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2024-10-11 03:00:43,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:00:43,787 INFO L225 Difference]: With dead ends: 714 [2024-10-11 03:00:43,788 INFO L226 Difference]: Without dead ends: 482 [2024-10-11 03:00:43,789 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2024-10-11 03:00:43,790 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 155 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:00:43,790 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 238 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:00:43,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2024-10-11 03:00:43,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 464. [2024-10-11 03:00:43,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 347 states have (on average 1.2997118155619596) internal successors, (451), 379 states have internal predecessors, (451), 57 states have call successors, (57), 49 states have call predecessors, (57), 59 states have return successors, (115), 58 states have call predecessors, (115), 57 states have call successors, (115) [2024-10-11 03:00:43,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 623 transitions. [2024-10-11 03:00:43,835 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 623 transitions. Word has length 34 [2024-10-11 03:00:43,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:00:43,835 INFO L471 AbstractCegarLoop]: Abstraction has 464 states and 623 transitions. [2024-10-11 03:00:43,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 03:00:43,836 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 623 transitions. [2024-10-11 03:00:43,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-11 03:00:43,841 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:00:43,841 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:00:43,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 03:00:43,842 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:00:43,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:00:43,842 INFO L85 PathProgramCache]: Analyzing trace with hash -632880623, now seen corresponding path program 1 times [2024-10-11 03:00:43,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:00:43,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477550437] [2024-10-11 03:00:43,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:00:43,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:00:43,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:43,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 03:00:43,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:43,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 03:00:43,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:43,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:00:43,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:43,922 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:00:43,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:00:43,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477550437] [2024-10-11 03:00:43,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477550437] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:00:43,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:00:43,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:00:43,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143408682] [2024-10-11 03:00:43,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:00:43,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:00:43,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:00:43,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:00:43,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:00:43,924 INFO L87 Difference]: Start difference. First operand 464 states and 623 transitions. Second operand has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 03:00:44,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:00:44,202 INFO L93 Difference]: Finished difference Result 558 states and 746 transitions. [2024-10-11 03:00:44,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 03:00:44,203 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 53 [2024-10-11 03:00:44,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:00:44,205 INFO L225 Difference]: With dead ends: 558 [2024-10-11 03:00:44,205 INFO L226 Difference]: Without dead ends: 235 [2024-10-11 03:00:44,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-10-11 03:00:44,207 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 174 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:00:44,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 209 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:00:44,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-10-11 03:00:44,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 227. [2024-10-11 03:00:44,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 170 states have (on average 1.2529411764705882) internal successors, (213), 185 states have internal predecessors, (213), 27 states have call successors, (27), 24 states have call predecessors, (27), 29 states have return successors, (56), 28 states have call predecessors, (56), 27 states have call successors, (56) [2024-10-11 03:00:44,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 296 transitions. [2024-10-11 03:00:44,225 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 296 transitions. Word has length 53 [2024-10-11 03:00:44,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:00:44,226 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 296 transitions. [2024-10-11 03:00:44,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 03:00:44,226 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 296 transitions. [2024-10-11 03:00:44,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-11 03:00:44,227 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:00:44,227 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:00:44,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 03:00:44,228 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:00:44,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:00:44,228 INFO L85 PathProgramCache]: Analyzing trace with hash -952453082, now seen corresponding path program 1 times [2024-10-11 03:00:44,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:00:44,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284343393] [2024-10-11 03:00:44,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:00:44,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:00:44,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:44,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 03:00:44,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:44,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 03:00:44,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:44,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:00:44,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:44,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 03:00:44,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:44,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:00:44,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:44,364 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 03:00:44,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:00:44,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284343393] [2024-10-11 03:00:44,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284343393] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:00:44,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794239765] [2024-10-11 03:00:44,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:00:44,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:00:44,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:00:44,367 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:00:44,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 03:00:44,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:44,451 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 03:00:44,460 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:00:44,561 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:00:44,562 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:00:44,684 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 03:00:44,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794239765] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:00:44,685 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:00:44,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 8 [2024-10-11 03:00:44,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673552756] [2024-10-11 03:00:44,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:00:44,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:00:44,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:00:44,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:00:44,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:00:44,686 INFO L87 Difference]: Start difference. First operand 227 states and 296 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 5 states have internal predecessors, (58), 3 states have call successors, (12), 6 states have call predecessors, (12), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 03:00:45,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:00:45,211 INFO L93 Difference]: Finished difference Result 543 states and 752 transitions. [2024-10-11 03:00:45,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-11 03:00:45,211 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 5 states have internal predecessors, (58), 3 states have call successors, (12), 6 states have call predecessors, (12), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 63 [2024-10-11 03:00:45,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:00:45,215 INFO L225 Difference]: With dead ends: 543 [2024-10-11 03:00:45,215 INFO L226 Difference]: Without dead ends: 354 [2024-10-11 03:00:45,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 135 SyntacticMatches, 6 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=126, Invalid=294, Unknown=0, NotChecked=0, Total=420 [2024-10-11 03:00:45,217 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 235 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:00:45,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 245 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 03:00:45,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-10-11 03:00:45,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 312. [2024-10-11 03:00:45,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 231 states have (on average 1.2554112554112553) internal successors, (290), 252 states have internal predecessors, (290), 39 states have call successors, (39), 35 states have call predecessors, (39), 41 states have return successors, (85), 37 states have call predecessors, (85), 39 states have call successors, (85) [2024-10-11 03:00:45,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 414 transitions. [2024-10-11 03:00:45,246 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 414 transitions. Word has length 63 [2024-10-11 03:00:45,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:00:45,248 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 414 transitions. [2024-10-11 03:00:45,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 5 states have internal predecessors, (58), 3 states have call successors, (12), 6 states have call predecessors, (12), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 03:00:45,248 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 414 transitions. [2024-10-11 03:00:45,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 03:00:45,250 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:00:45,250 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:00:45,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 03:00:45,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 03:00:45,451 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:00:45,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:00:45,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1879918935, now seen corresponding path program 2 times [2024-10-11 03:00:45,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:00:45,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219361320] [2024-10-11 03:00:45,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:00:45,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:00:45,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:45,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 03:00:45,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:45,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 03:00:45,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:45,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:00:45,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:45,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 03:00:45,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:45,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 03:00:45,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:45,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:00:45,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:45,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 03:00:45,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:45,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:00:45,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:45,781 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 44 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 03:00:45,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:00:45,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219361320] [2024-10-11 03:00:45,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219361320] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:00:45,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473724447] [2024-10-11 03:00:45,781 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 03:00:45,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:00:45,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:00:45,783 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:00:45,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 03:00:45,874 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 03:00:45,874 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 03:00:45,876 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 03:00:45,879 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:00:45,965 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 03:00:45,965 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 03:00:45,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [473724447] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:00:45,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 03:00:45,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-10-11 03:00:45,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557146726] [2024-10-11 03:00:45,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:00:45,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:00:45,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:00:45,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:00:45,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-10-11 03:00:45,968 INFO L87 Difference]: Start difference. First operand 312 states and 414 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 03:00:46,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:00:46,169 INFO L93 Difference]: Finished difference Result 828 states and 1155 transitions. [2024-10-11 03:00:46,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:00:46,170 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 92 [2024-10-11 03:00:46,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:00:46,174 INFO L225 Difference]: With dead ends: 828 [2024-10-11 03:00:46,174 INFO L226 Difference]: Without dead ends: 553 [2024-10-11 03:00:46,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 103 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-10-11 03:00:46,176 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 118 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:00:46,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 259 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:00:46,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2024-10-11 03:00:46,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 532. [2024-10-11 03:00:46,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 394 states have (on average 1.2461928934010151) internal successors, (491), 423 states have internal predecessors, (491), 67 states have call successors, (67), 63 states have call predecessors, (67), 70 states have return successors, (131), 63 states have call predecessors, (131), 67 states have call successors, (131) [2024-10-11 03:00:46,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 689 transitions. [2024-10-11 03:00:46,219 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 689 transitions. Word has length 92 [2024-10-11 03:00:46,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:00:46,220 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 689 transitions. [2024-10-11 03:00:46,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 03:00:46,220 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 689 transitions. [2024-10-11 03:00:46,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 03:00:46,222 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:00:46,222 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:00:46,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 03:00:46,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:00:46,423 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:00:46,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:00:46,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1521562023, now seen corresponding path program 1 times [2024-10-11 03:00:46,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:00:46,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855084743] [2024-10-11 03:00:46,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:00:46,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:00:46,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:46,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 03:00:46,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:46,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 03:00:46,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:46,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:00:46,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:46,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 03:00:46,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:46,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 03:00:46,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:46,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:00:46,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:46,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 03:00:46,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:46,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:00:46,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:46,550 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 03:00:46,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:00:46,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855084743] [2024-10-11 03:00:46,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855084743] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:00:46,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:00:46,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:00:46,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527361897] [2024-10-11 03:00:46,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:00:46,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:00:46,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:00:46,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:00:46,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:00:46,551 INFO L87 Difference]: Start difference. First operand 532 states and 689 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 03:00:46,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:00:46,730 INFO L93 Difference]: Finished difference Result 740 states and 941 transitions. [2024-10-11 03:00:46,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:00:46,730 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 92 [2024-10-11 03:00:46,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:00:46,732 INFO L225 Difference]: With dead ends: 740 [2024-10-11 03:00:46,732 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 03:00:46,734 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 03:00:46,735 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 52 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:00:46,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 125 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:00:46,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 03:00:46,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 03:00:46,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:00:46,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 03:00:46,737 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 92 [2024-10-11 03:00:46,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:00:46,737 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 03:00:46,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 03:00:46,737 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 03:00:46,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 03:00:46,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 03:00:46,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 03:00:46,743 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:00:46,746 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 03:00:48,260 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 03:00:48,278 WARN L155 FloydHoareUtils]: Requires clause for deactivatePump contained old-variable. Original clause: (and (= ~pumpRunning~0 |old(~pumpRunning~0)|) (or (and (<= 2 ~waterLevel~0) (not (= 0 ~systemActive~0))) (= 1 ~systemActive~0))) Eliminated clause: (or (and (<= 2 ~waterLevel~0) (not (= 0 ~systemActive~0))) (= 1 ~systemActive~0)) [2024-10-11 03:00:48,295 WARN L155 FloydHoareUtils]: Requires clause for timeShift contained old-variable. Original clause: (and (= ~pumpRunning~0 |old(~pumpRunning~0)|) (let ((.cse0 (= 1 ~systemActive~0)) (.cse1 (= |old(~pumpRunning~0)| 0))) (or (and .cse0 (<= 2 |old(~waterLevel~0)|)) (and .cse1 (= 0 ~systemActive~0)) (and .cse0 .cse1 (<= 1 |old(~waterLevel~0)|)))) (= |old(~waterLevel~0)| ~waterLevel~0)) Eliminated clause: (let ((.cse1 (= 1 ~systemActive~0)) (.cse0 (= ~pumpRunning~0 0))) (or (and .cse0 .cse1 (<= 1 ~waterLevel~0)) (and (<= 2 ~waterLevel~0) .cse1) (and .cse0 (= 0 ~systemActive~0)))) [2024-10-11 03:00:48,301 WARN L155 FloydHoareUtils]: Requires clause for processEnvironment__wrappee__highWaterSensor contained old-variable. Original clause: (and (= ~pumpRunning~0 0) (= 1 ~systemActive~0) (= |old(~pumpRunning~0)| 0) (<= 1 ~waterLevel~0)) Eliminated clause: (and (= ~pumpRunning~0 0) (= 1 ~systemActive~0) (<= 1 ~waterLevel~0)) [2024-10-11 03:00:48,305 WARN L155 FloydHoareUtils]: Requires clause for waterRise contained old-variable. Original clause: (and (let ((.cse0 (= 1 ~systemActive~0)) (.cse1 (= ~pumpRunning~0 0))) (or (and .cse0 (<= 2 |old(~waterLevel~0)|)) (and .cse1 .cse0 (<= 1 |old(~waterLevel~0)|)) (and .cse1 (= 0 ~systemActive~0)))) (= |old(~waterLevel~0)| ~waterLevel~0)) Eliminated clause: (let ((.cse1 (= 1 ~systemActive~0)) (.cse0 (= ~pumpRunning~0 0))) (or (and .cse0 .cse1 (<= 1 ~waterLevel~0)) (and (<= 2 ~waterLevel~0) .cse1) (and .cse0 (= 0 ~systemActive~0)))) [2024-10-11 03:00:48,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 03:00:48 BoogieIcfgContainer [2024-10-11 03:00:48,309 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 03:00:48,310 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 03:00:48,310 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 03:00:48,310 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 03:00:48,311 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:00:40" (3/4) ... [2024-10-11 03:00:48,313 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 03:00:48,317 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure deactivatePump [2024-10-11 03:00:48,318 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base [2024-10-11 03:00:48,318 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2024-10-11 03:00:48,318 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure cleanup [2024-10-11 03:00:48,318 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure timeShift [2024-10-11 03:00:48,318 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__highWaterSensor [2024-10-11 03:00:48,318 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure waterRise [2024-10-11 03:00:48,328 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 34 nodes and edges [2024-10-11 03:00:48,329 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2024-10-11 03:00:48,330 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-11 03:00:48,330 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 03:00:48,330 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 03:00:48,461 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 03:00:48,461 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 03:00:48,461 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 03:00:48,462 INFO L158 Benchmark]: Toolchain (without parser) took 9122.71ms. Allocated memory was 163.6MB in the beginning and 218.1MB in the end (delta: 54.5MB). Free memory was 114.6MB in the beginning and 164.1MB in the end (delta: -49.5MB). Peak memory consumption was 6.8MB. Max. memory is 16.1GB. [2024-10-11 03:00:48,462 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 163.6MB. Free memory was 126.3MB in the beginning and 126.1MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 03:00:48,463 INFO L158 Benchmark]: CACSL2BoogieTranslator took 555.21ms. Allocated memory is still 163.6MB. Free memory was 114.2MB in the beginning and 92.7MB in the end (delta: 21.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-11 03:00:48,463 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.37ms. Allocated memory is still 163.6MB. Free memory was 92.7MB in the beginning and 90.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 03:00:48,463 INFO L158 Benchmark]: Boogie Preprocessor took 46.15ms. Allocated memory is still 163.6MB. Free memory was 90.6MB in the beginning and 87.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 03:00:48,463 INFO L158 Benchmark]: RCFGBuilder took 648.46ms. Allocated memory is still 163.6MB. Free memory was 87.9MB in the beginning and 63.3MB in the end (delta: 24.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-11 03:00:48,464 INFO L158 Benchmark]: TraceAbstraction took 7657.22ms. Allocated memory was 163.6MB in the beginning and 218.1MB in the end (delta: 54.5MB). Free memory was 62.8MB in the beginning and 171.4MB in the end (delta: -108.6MB). Peak memory consumption was 63.4MB. Max. memory is 16.1GB. [2024-10-11 03:00:48,464 INFO L158 Benchmark]: Witness Printer took 151.54ms. Allocated memory is still 218.1MB. Free memory was 171.4MB in the beginning and 164.1MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 03:00:48,465 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 163.6MB. Free memory was 126.3MB in the beginning and 126.1MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 555.21ms. Allocated memory is still 163.6MB. Free memory was 114.2MB in the beginning and 92.7MB in the end (delta: 21.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.37ms. Allocated memory is still 163.6MB. Free memory was 92.7MB in the beginning and 90.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.15ms. Allocated memory is still 163.6MB. Free memory was 90.6MB in the beginning and 87.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 648.46ms. Allocated memory is still 163.6MB. Free memory was 87.9MB in the beginning and 63.3MB in the end (delta: 24.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 7657.22ms. Allocated memory was 163.6MB in the beginning and 218.1MB in the end (delta: 54.5MB). Free memory was 62.8MB in the beginning and 171.4MB in the end (delta: -108.6MB). Peak memory consumption was 63.4MB. Max. memory is 16.1GB. * Witness Printer took 151.54ms. Allocated memory is still 218.1MB. Free memory was 171.4MB in the beginning and 164.1MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. 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,"Specification4_spec.i","") [87] - GenericResultAtLocation [Line: 116]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [116] - GenericResultAtLocation [Line: 188]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [188] - GenericResultAtLocation [Line: 426]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [426] - GenericResultAtLocation [Line: 522]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [522] - GenericResultAtLocation [Line: 625]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [625] - GenericResultAtLocation [Line: 634]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [634] * 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: 630]: 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 8 procedures, 71 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.0s, OverallIterations: 12, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1302 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1278 mSDsluCounter, 2212 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1438 mSDsCounter, 291 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1887 IncrementalHoareTripleChecker+Invalid, 2178 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 291 mSolverCounterUnsat, 774 mSDtfsCounter, 1887 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 389 GetRequests, 292 SyntacticMatches, 9 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=532occurred in iteration=11, InterpolantAutomatonStates: 92, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 12 MinimizatonAttempts, 204 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 638 NumberOfCodeBlocks, 638 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 686 ConstructedInterpolants, 0 QuantifiedInterpolants, 1309 SizeOfPredicates, 3 NumberOfNonLiveVariables, 544 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 15 InterpolantComputations, 11 PerfectInterpolantSequences, 236/261 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: 131]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: (((((2 <= waterLevel) && (1 == systemActive)) && (splverifierCounter == 0)) || (((pumpRunning == 0) && (splverifierCounter == 0)) && (0 == systemActive))) || ((((pumpRunning == 0) && (1 == systemActive)) && (splverifierCounter == 0)) && (1 <= waterLevel))) - InvariantResult [Line: 438]: Loop Invariant Derived loop invariant: 0 - ProcedureContractResult [Line: 309]: Procedure Contract for deactivatePump Derived contract for procedure deactivatePump. Requires: (((2 <= waterLevel) && (0 != systemActive)) || (1 == systemActive)) Ensures: ((pumpRunning == 0) && (((2 <= waterLevel) && (0 != systemActive)) || (1 == systemActive))) - ProcedureContractResult [Line: 224]: Procedure Contract for processEnvironment__wrappee__base Derived contract for procedure processEnvironment__wrappee__base. Requires: ((((pumpRunning == 0) && (1 == systemActive)) && (waterLevel == 1)) || (((pumpRunning == 0) && (2 <= waterLevel)) && (1 == systemActive))) Ensures: ((((pumpRunning == 0) && (1 == systemActive)) && (waterLevel == 1)) || (((pumpRunning == 0) && (2 <= waterLevel)) && (1 == systemActive))) - ProcedureContractResult [Line: 549]: Procedure Contract for changeMethaneLevel Derived contract for procedure changeMethaneLevel. Requires: (((((pumpRunning == 0) && (1 == systemActive)) && (waterLevel == 1)) || ((2 <= waterLevel) && (1 == systemActive))) || ((pumpRunning == 0) && (0 == systemActive))) Ensures: (((((pumpRunning == 0) && (1 == systemActive)) && (waterLevel == 1)) || ((2 <= waterLevel) && (1 == systemActive))) || ((pumpRunning == 0) && (0 == systemActive))) - ProcedureContractResult [Line: 428]: Procedure Contract for cleanup Derived contract for procedure cleanup. Requires: 0 Ensures: 0 - ProcedureContractResult [Line: 200]: Procedure Contract for timeShift Derived contract for procedure timeShift. Requires: (((((pumpRunning == 0) && (1 == systemActive)) && (1 <= waterLevel)) || ((2 <= waterLevel) && (1 == systemActive))) || ((pumpRunning == 0) && (0 == systemActive))) Ensures: ((((((1 == systemActive) && (2 <= \old(waterLevel))) || (\old(pumpRunning) == 0)) && (((pumpRunning == 0) && (\old(waterLevel) == waterLevel)) || (0 != systemActive))) && (((1 < waterLevel) || ((pumpRunning == 0) && (waterLevel == 1))) || (0 == systemActive))) && (((\old(pumpRunning) != 0) || ((1 == systemActive) && (\old(waterLevel) == waterLevel))) || (0 == systemActive))) - ProcedureContractResult [Line: 232]: Procedure Contract for processEnvironment__wrappee__highWaterSensor Derived contract for procedure processEnvironment__wrappee__highWaterSensor. Requires: (((pumpRunning == 0) && (1 == systemActive)) && (1 <= waterLevel)) Ensures: ((((1 == systemActive) && (\old(pumpRunning) == 0)) && (1 <= waterLevel)) && ((pumpRunning == 0) || (1 < waterLevel))) - ProcedureContractResult [Line: 537]: Procedure Contract for waterRise Derived contract for procedure waterRise. Requires: (((((pumpRunning == 0) && (1 == systemActive)) && (1 <= waterLevel)) || ((2 <= waterLevel) && (1 == systemActive))) || ((pumpRunning == 0) && (0 == systemActive))) Ensures: ((((\old(waterLevel) < 2) || (\old(waterLevel) == waterLevel)) && (((1 == systemActive) && (1 <= \old(waterLevel))) || ((pumpRunning == 0) && (0 == systemActive)))) && (((\old(waterLevel) != 1) || ((pumpRunning == 0) && (2 <= waterLevel))) || (0 == systemActive))) RESULT: Ultimate proved your program to be correct! [2024-10-11 03:00:48,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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