./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_spec2_product50.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_spec2_product50.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 f645b80d4169704e02b3c19c65a00755e1e28cc942f5a2526cd4b4e1dcca30cf --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 02:58:42,839 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 02:58:42,930 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 02:58:42,937 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 02:58:42,938 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 02:58:42,972 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 02:58:42,973 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 02:58:42,974 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 02:58:42,974 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 02:58:42,976 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 02:58:42,976 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 02:58:42,977 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 02:58:42,977 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 02:58:42,977 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 02:58:42,978 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 02:58:42,981 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 02:58:42,981 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 02:58:42,982 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 02:58:42,982 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 02:58:42,982 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 02:58:42,982 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 02:58:42,984 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 02:58:42,984 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 02:58:42,984 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 02:58:42,985 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 02:58:42,985 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 02:58:42,985 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 02:58:42,986 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 02:58:42,986 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 02:58:42,986 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 02:58:42,986 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 02:58:42,987 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 02:58:42,987 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:58:42,988 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 02:58:42,988 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 02:58:42,988 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 02:58:42,988 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 02:58:42,989 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 02:58:42,989 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 02:58:42,989 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 02:58:42,989 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 02:58:42,990 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 02:58:42,990 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 -> f645b80d4169704e02b3c19c65a00755e1e28cc942f5a2526cd4b4e1dcca30cf [2024-10-11 02:58:43,229 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 02:58:43,255 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 02:58:43,259 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 02:58:43,261 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 02:58:43,261 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 02:58:43,262 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product50.cil.c [2024-10-11 02:58:44,715 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 02:58:44,968 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 02:58:44,969 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product50.cil.c [2024-10-11 02:58:44,983 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/bd21a51d1/883ed44927994ab19f0e6994d68233e6/FLAG30048b7b6 [2024-10-11 02:58:45,292 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/bd21a51d1/883ed44927994ab19f0e6994d68233e6 [2024-10-11 02:58:45,295 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 02:58:45,296 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 02:58:45,298 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 02:58:45,299 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 02:58:45,304 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 02:58:45,306 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:58:45" (1/1) ... [2024-10-11 02:58:45,307 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58586dd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:58:45, skipping insertion in model container [2024-10-11 02:58:45,307 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:58:45" (1/1) ... [2024-10-11 02:58:45,359 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 02:58:45,707 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_spec2_product50.cil.c[18939,18952] [2024-10-11 02:58:45,714 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:58:45,729 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 02:58:45,739 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [49] [2024-10-11 02:58:45,741 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [87] [2024-10-11 02:58:45,741 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [190] [2024-10-11 02:58:45,741 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [232] [2024-10-11 02:58:45,741 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [340] [2024-10-11 02:58:45,741 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [548] [2024-10-11 02:58:45,742 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [615] [2024-10-11 02:58:45,742 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [981] [2024-10-11 02:58:45,830 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_spec2_product50.cil.c[18939,18952] [2024-10-11 02:58:45,834 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:58:45,859 INFO L204 MainTranslator]: Completed translation [2024-10-11 02:58:45,860 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:58:45 WrapperNode [2024-10-11 02:58:45,860 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 02:58:45,861 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 02:58:45,862 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 02:58:45,862 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 02:58:45,869 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:58:45" (1/1) ... [2024-10-11 02:58:45,888 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:58:45" (1/1) ... [2024-10-11 02:58:45,925 INFO L138 Inliner]: procedures = 57, calls = 100, calls flagged for inlining = 24, calls inlined = 21, statements flattened = 209 [2024-10-11 02:58:45,926 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 02:58:45,926 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 02:58:45,926 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 02:58:45,927 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 02:58:45,937 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:58:45" (1/1) ... [2024-10-11 02:58:45,937 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:58:45" (1/1) ... [2024-10-11 02:58:45,939 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:58:45" (1/1) ... [2024-10-11 02:58:45,954 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 02:58:45,955 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:58:45" (1/1) ... [2024-10-11 02:58:45,955 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:58:45" (1/1) ... [2024-10-11 02:58:45,960 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:58:45" (1/1) ... [2024-10-11 02:58:45,967 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:58:45" (1/1) ... [2024-10-11 02:58:45,968 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:58:45" (1/1) ... [2024-10-11 02:58:45,970 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:58:45" (1/1) ... [2024-10-11 02:58:45,972 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 02:58:45,973 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 02:58:45,973 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 02:58:45,974 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 02:58:45,975 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:58:45" (1/1) ... [2024-10-11 02:58:45,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:58:45,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:58:46,013 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 02:58:46,026 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 02:58:46,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 02:58:46,075 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-10-11 02:58:46,075 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-10-11 02:58:46,075 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2024-10-11 02:58:46,076 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2024-10-11 02:58:46,076 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-11 02:58:46,076 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-11 02:58:46,076 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-11 02:58:46,076 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-11 02:58:46,076 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2024-10-11 02:58:46,077 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2024-10-11 02:58:46,077 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-10-11 02:58:46,077 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-10-11 02:58:46,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 02:58:46,077 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-10-11 02:58:46,078 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-10-11 02:58:46,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 02:58:46,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 02:58:46,175 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 02:58:46,178 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 02:58:46,520 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2024-10-11 02:58:46,520 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 02:58:46,610 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 02:58:46,611 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 02:58:46,612 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:58:46 BoogieIcfgContainer [2024-10-11 02:58:46,612 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 02:58:46,616 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 02:58:46,616 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 02:58:46,620 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 02:58:46,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:58:45" (1/3) ... [2024-10-11 02:58:46,621 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@574dc3af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:58:46, skipping insertion in model container [2024-10-11 02:58:46,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:58:45" (2/3) ... [2024-10-11 02:58:46,623 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@574dc3af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:58:46, skipping insertion in model container [2024-10-11 02:58:46,623 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:58:46" (3/3) ... [2024-10-11 02:58:46,624 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec2_product50.cil.c [2024-10-11 02:58:46,642 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 02:58:46,643 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 02:58:46,699 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 02:58:46,706 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;@67daadc4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 02:58:46,706 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 02:58:46,711 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 48 states have (on average 1.5625) internal successors, (75), 56 states have internal predecessors, (75), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 02:58:46,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 02:58:46,722 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:58:46,723 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:58:46,723 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:58:46,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:58:46,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1548485415, now seen corresponding path program 1 times [2024-10-11 02:58:46,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:58:46,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955982097] [2024-10-11 02:58:46,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:58:46,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:58:46,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:46,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:58:46,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:46,923 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 02:58:46,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:58:46,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955982097] [2024-10-11 02:58:46,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955982097] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:58:46,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:58:46,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 02:58:46,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469751591] [2024-10-11 02:58:46,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:58:46,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 02:58:46,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:58:46,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 02:58:46,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 02:58:46,951 INFO L87 Difference]: Start difference. First operand has 68 states, 48 states have (on average 1.5625) internal successors, (75), 56 states have internal predecessors, (75), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 02:58:47,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:58:47,008 INFO L93 Difference]: Finished difference Result 134 states and 195 transitions. [2024-10-11 02:58:47,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 02:58:47,010 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-10-11 02:58:47,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:58:47,021 INFO L225 Difference]: With dead ends: 134 [2024-10-11 02:58:47,022 INFO L226 Difference]: Without dead ends: 63 [2024-10-11 02:58:47,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 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 02:58:47,032 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:58:47,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:58:47,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-11 02:58:47,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-10-11 02:58:47,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 45 states have (on average 1.4444444444444444) internal successors, (65), 52 states have internal predecessors, (65), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 02:58:47,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 86 transitions. [2024-10-11 02:58:47,082 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 86 transitions. Word has length 17 [2024-10-11 02:58:47,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:58:47,084 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 86 transitions. [2024-10-11 02:58:47,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 02:58:47,085 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 86 transitions. [2024-10-11 02:58:47,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 02:58:47,087 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:58:47,087 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:58:47,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 02:58:47,088 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:58:47,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:58:47,088 INFO L85 PathProgramCache]: Analyzing trace with hash -2091235733, now seen corresponding path program 1 times [2024-10-11 02:58:47,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:58:47,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038152643] [2024-10-11 02:58:47,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:58:47,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:58:47,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:47,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 02:58:47,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:47,241 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 02:58:47,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:58:47,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038152643] [2024-10-11 02:58:47,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038152643] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:58:47,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:58:47,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 02:58:47,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661931273] [2024-10-11 02:58:47,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:58:47,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 02:58:47,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:58:47,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 02:58:47,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 02:58:47,249 INFO L87 Difference]: Start difference. First operand 63 states and 86 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 02:58:47,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:58:47,303 INFO L93 Difference]: Finished difference Result 99 states and 135 transitions. [2024-10-11 02:58:47,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 02:58:47,304 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-10-11 02:58:47,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:58:47,305 INFO L225 Difference]: With dead ends: 99 [2024-10-11 02:58:47,307 INFO L226 Difference]: Without dead ends: 55 [2024-10-11 02:58:47,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 02:58:47,309 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 11 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:58:47,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 113 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:58:47,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-11 02:58:47,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-10-11 02:58:47,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 40 states have (on average 1.475) internal successors, (59), 47 states have internal predecessors, (59), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 02:58:47,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 75 transitions. [2024-10-11 02:58:47,325 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 75 transitions. Word has length 18 [2024-10-11 02:58:47,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:58:47,326 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 75 transitions. [2024-10-11 02:58:47,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 02:58:47,326 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 75 transitions. [2024-10-11 02:58:47,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 02:58:47,327 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:58:47,328 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 02:58:47,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 02:58:47,328 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:58:47,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:58:47,329 INFO L85 PathProgramCache]: Analyzing trace with hash -2070527680, now seen corresponding path program 1 times [2024-10-11 02:58:47,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:58:47,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22573601] [2024-10-11 02:58:47,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:58:47,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:58:47,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:47,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 02:58:47,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:47,445 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 02:58:47,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:58:47,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22573601] [2024-10-11 02:58:47,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22573601] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:58:47,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:58:47,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 02:58:47,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026922184] [2024-10-11 02:58:47,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:58:47,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 02:58:47,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:58:47,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 02:58:47,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 02:58:47,449 INFO L87 Difference]: Start difference. First operand 55 states and 75 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 02:58:47,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:58:47,502 INFO L93 Difference]: Finished difference Result 108 states and 149 transitions. [2024-10-11 02:58:47,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 02:58:47,502 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-10-11 02:58:47,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:58:47,504 INFO L225 Difference]: With dead ends: 108 [2024-10-11 02:58:47,504 INFO L226 Difference]: Without dead ends: 55 [2024-10-11 02:58:47,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 02:58:47,505 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 70 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:58:47,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 61 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:58:47,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-11 02:58:47,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-10-11 02:58:47,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 40 states have (on average 1.45) internal successors, (58), 47 states have internal predecessors, (58), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 02:58:47,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 74 transitions. [2024-10-11 02:58:47,523 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 74 transitions. Word has length 21 [2024-10-11 02:58:47,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:58:47,524 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 74 transitions. [2024-10-11 02:58:47,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 02:58:47,524 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 74 transitions. [2024-10-11 02:58:47,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 02:58:47,528 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:58:47,528 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] [2024-10-11 02:58:47,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 02:58:47,528 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:58:47,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:58:47,529 INFO L85 PathProgramCache]: Analyzing trace with hash -968540195, now seen corresponding path program 1 times [2024-10-11 02:58:47,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:58:47,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191097087] [2024-10-11 02:58:47,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:58:47,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:58:47,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:47,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 02:58:47,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:47,632 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 02:58:47,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:58:47,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191097087] [2024-10-11 02:58:47,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191097087] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:58:47,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:58:47,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 02:58:47,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951063242] [2024-10-11 02:58:47,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:58:47,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 02:58:47,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:58:47,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 02:58:47,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 02:58:47,635 INFO L87 Difference]: Start difference. First operand 55 states and 74 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 02:58:47,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:58:47,700 INFO L93 Difference]: Finished difference Result 147 states and 201 transitions. [2024-10-11 02:58:47,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 02:58:47,701 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2024-10-11 02:58:47,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:58:47,702 INFO L225 Difference]: With dead ends: 147 [2024-10-11 02:58:47,702 INFO L226 Difference]: Without dead ends: 94 [2024-10-11 02:58:47,703 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 02:58:47,704 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 48 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:58:47,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 122 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:58:47,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-11 02:58:47,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2024-10-11 02:58:47,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 67 states have (on average 1.4029850746268657) internal successors, (94), 74 states have internal predecessors, (94), 12 states have call successors, (12), 12 states have call predecessors, (12), 12 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2024-10-11 02:58:47,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 122 transitions. [2024-10-11 02:58:47,725 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 122 transitions. Word has length 26 [2024-10-11 02:58:47,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:58:47,725 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 122 transitions. [2024-10-11 02:58:47,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 02:58:47,726 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 122 transitions. [2024-10-11 02:58:47,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-11 02:58:47,727 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:58:47,728 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] [2024-10-11 02:58:47,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 02:58:47,728 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:58:47,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:58:47,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1185555006, now seen corresponding path program 1 times [2024-10-11 02:58:47,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:58:47,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138092516] [2024-10-11 02:58:47,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:58:47,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:58:47,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:47,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 02:58:47,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:47,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 02:58:47,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:47,912 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 02:58:47,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:58:47,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138092516] [2024-10-11 02:58:47,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138092516] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:58:47,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:58:47,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:58:47,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760939709] [2024-10-11 02:58:47,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:58:47,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:58:47,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:58:47,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:58:47,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:58:47,916 INFO L87 Difference]: Start difference. First operand 92 states and 122 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 02:58:48,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:58:48,138 INFO L93 Difference]: Finished difference Result 206 states and 282 transitions. [2024-10-11 02:58:48,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 02:58:48,139 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2024-10-11 02:58:48,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:58:48,141 INFO L225 Difference]: With dead ends: 206 [2024-10-11 02:58:48,144 INFO L226 Difference]: Without dead ends: 116 [2024-10-11 02:58:48,145 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:58:48,146 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 107 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:58:48,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 177 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:58:48,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-10-11 02:58:48,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2024-10-11 02:58:48,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 84 states have (on average 1.3928571428571428) internal successors, (117), 91 states have internal predecessors, (117), 14 states have call successors, (14), 12 states have call predecessors, (14), 15 states have return successors, (21), 15 states have call predecessors, (21), 14 states have call successors, (21) [2024-10-11 02:58:48,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 152 transitions. [2024-10-11 02:58:48,179 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 152 transitions. Word has length 33 [2024-10-11 02:58:48,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:58:48,182 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 152 transitions. [2024-10-11 02:58:48,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 02:58:48,183 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 152 transitions. [2024-10-11 02:58:48,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-11 02:58:48,184 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:58:48,184 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] [2024-10-11 02:58:48,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 02:58:48,184 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:58:48,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:58:48,185 INFO L85 PathProgramCache]: Analyzing trace with hash 94308672, now seen corresponding path program 1 times [2024-10-11 02:58:48,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:58:48,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352634485] [2024-10-11 02:58:48,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:58:48,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:58:48,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:48,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 02:58:48,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:48,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 02:58:48,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:48,288 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 02:58:48,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:58:48,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352634485] [2024-10-11 02:58:48,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352634485] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:58:48,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:58:48,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 02:58:48,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771284746] [2024-10-11 02:58:48,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:58:48,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:58:48,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:58:48,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:58:48,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 02:58:48,293 INFO L87 Difference]: Start difference. First operand 114 states and 152 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 02:58:48,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:58:48,430 INFO L93 Difference]: Finished difference Result 230 states and 310 transitions. [2024-10-11 02:58:48,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 02:58:48,431 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2024-10-11 02:58:48,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:58:48,432 INFO L225 Difference]: With dead ends: 230 [2024-10-11 02:58:48,432 INFO L226 Difference]: Without dead ends: 118 [2024-10-11 02:58:48,433 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:58:48,434 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 44 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:58:48,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 186 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:58:48,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-11 02:58:48,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2024-10-11 02:58:48,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 86 states have (on average 1.3837209302325582) internal successors, (119), 93 states have internal predecessors, (119), 14 states have call successors, (14), 12 states have call predecessors, (14), 15 states have return successors, (21), 15 states have call predecessors, (21), 14 states have call successors, (21) [2024-10-11 02:58:48,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 154 transitions. [2024-10-11 02:58:48,452 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 154 transitions. Word has length 33 [2024-10-11 02:58:48,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:58:48,453 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 154 transitions. [2024-10-11 02:58:48,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 02:58:48,453 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 154 transitions. [2024-10-11 02:58:48,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-11 02:58:48,454 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:58:48,454 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] [2024-10-11 02:58:48,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 02:58:48,455 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:58:48,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:58:48,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1521064388, now seen corresponding path program 1 times [2024-10-11 02:58:48,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:58:48,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519029204] [2024-10-11 02:58:48,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:58:48,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:58:48,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:48,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 02:58:48,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:48,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 02:58:48,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:48,545 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 02:58:48,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:58:48,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519029204] [2024-10-11 02:58:48,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519029204] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:58:48,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:58:48,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 02:58:48,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038318450] [2024-10-11 02:58:48,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:58:48,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:58:48,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:58:48,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:58:48,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 02:58:48,551 INFO L87 Difference]: Start difference. First operand 116 states and 154 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 02:58:48,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:58:48,829 INFO L93 Difference]: Finished difference Result 378 states and 532 transitions. [2024-10-11 02:58:48,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:58:48,830 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2024-10-11 02:58:48,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:58:48,834 INFO L225 Difference]: With dead ends: 378 [2024-10-11 02:58:48,834 INFO L226 Difference]: Without dead ends: 264 [2024-10-11 02:58:48,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:58:48,836 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 185 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:58:48,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 238 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 02:58:48,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-10-11 02:58:48,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 254. [2024-10-11 02:58:48,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 187 states have (on average 1.3689839572192513) internal successors, (256), 199 states have internal predecessors, (256), 34 states have call successors, (34), 33 states have call predecessors, (34), 32 states have return successors, (58), 32 states have call predecessors, (58), 34 states have call successors, (58) [2024-10-11 02:58:48,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 348 transitions. [2024-10-11 02:58:48,883 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 348 transitions. Word has length 33 [2024-10-11 02:58:48,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:58:48,883 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 348 transitions. [2024-10-11 02:58:48,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 02:58:48,885 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 348 transitions. [2024-10-11 02:58:48,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-11 02:58:48,886 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:58:48,888 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:58:48,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 02:58:48,889 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:58:48,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:58:48,889 INFO L85 PathProgramCache]: Analyzing trace with hash -562769163, now seen corresponding path program 1 times [2024-10-11 02:58:48,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:58:48,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888935782] [2024-10-11 02:58:48,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:58:48,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:58:48,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:48,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 02:58:48,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:48,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 02:58:48,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:48,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:58:48,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:48,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:58:48,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:49,001 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 02:58:49,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:58:49,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888935782] [2024-10-11 02:58:49,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888935782] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:58:49,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:58:49,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:58:49,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559152083] [2024-10-11 02:58:49,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:58:49,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:58:49,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:58:49,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:58:49,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:58:49,008 INFO L87 Difference]: Start difference. First operand 254 states and 348 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 02:58:49,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:58:49,336 INFO L93 Difference]: Finished difference Result 559 states and 782 transitions. [2024-10-11 02:58:49,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 02:58:49,337 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 40 [2024-10-11 02:58:49,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:58:49,340 INFO L225 Difference]: With dead ends: 559 [2024-10-11 02:58:49,340 INFO L226 Difference]: Without dead ends: 307 [2024-10-11 02:58:49,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 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 02:58:49,346 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 151 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:58:49,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 192 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 02:58:49,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-10-11 02:58:49,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 301. [2024-10-11 02:58:49,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 221 states have (on average 1.330316742081448) internal successors, (294), 237 states have internal predecessors, (294), 42 states have call successors, (42), 33 states have call predecessors, (42), 37 states have return successors, (77), 41 states have call predecessors, (77), 42 states have call successors, (77) [2024-10-11 02:58:49,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 413 transitions. [2024-10-11 02:58:49,391 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 413 transitions. Word has length 40 [2024-10-11 02:58:49,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:58:49,392 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 413 transitions. [2024-10-11 02:58:49,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 02:58:49,392 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 413 transitions. [2024-10-11 02:58:49,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-11 02:58:49,394 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:58:49,394 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:58:49,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 02:58:49,394 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:58:49,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:58:49,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1298538402, now seen corresponding path program 1 times [2024-10-11 02:58:49,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:58:49,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055992096] [2024-10-11 02:58:49,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:58:49,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:58:49,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:49,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 02:58:49,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:49,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 02:58:49,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:49,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 02:58:49,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:49,448 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 02:58:49,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:58:49,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055992096] [2024-10-11 02:58:49,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055992096] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:58:49,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:58:49,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 02:58:49,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817378736] [2024-10-11 02:58:49,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:58:49,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:58:49,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:58:49,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:58:49,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 02:58:49,450 INFO L87 Difference]: Start difference. First operand 301 states and 413 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 02:58:49,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:58:49,724 INFO L93 Difference]: Finished difference Result 540 states and 764 transitions. [2024-10-11 02:58:49,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:58:49,725 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2024-10-11 02:58:49,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:58:49,729 INFO L225 Difference]: With dead ends: 540 [2024-10-11 02:58:49,729 INFO L226 Difference]: Without dead ends: 538 [2024-10-11 02:58:49,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:58:49,730 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 234 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:58:49,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 136 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 02:58:49,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2024-10-11 02:58:49,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 484. [2024-10-11 02:58:49,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 356 states have (on average 1.3314606741573034) internal successors, (474), 382 states have internal predecessors, (474), 68 states have call successors, (68), 54 states have call predecessors, (68), 59 states have return successors, (154), 63 states have call predecessors, (154), 68 states have call successors, (154) [2024-10-11 02:58:49,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 696 transitions. [2024-10-11 02:58:49,791 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 696 transitions. Word has length 37 [2024-10-11 02:58:49,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:58:49,791 INFO L471 AbstractCegarLoop]: Abstraction has 484 states and 696 transitions. [2024-10-11 02:58:49,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 02:58:49,791 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 696 transitions. [2024-10-11 02:58:49,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-11 02:58:49,793 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:58:49,794 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:58:49,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 02:58:49,794 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:58:49,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:58:49,795 INFO L85 PathProgramCache]: Analyzing trace with hash -816118374, now seen corresponding path program 1 times [2024-10-11 02:58:49,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:58:49,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210801081] [2024-10-11 02:58:49,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:58:49,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:58:49,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:49,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 02:58:49,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:49,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 02:58:49,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:49,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 02:58:49,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:49,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 02:58:49,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:49,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 02:58:49,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:49,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 02:58:49,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:49,907 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-11 02:58:49,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:58:49,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210801081] [2024-10-11 02:58:49,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210801081] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:58:49,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532484020] [2024-10-11 02:58:49,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:58:49,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:58:49,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:58:49,911 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 02:58:49,912 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 02:58:49,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:49,998 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 02:58:50,004 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:58:50,087 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:58:50,088 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:58:50,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [532484020] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:58:50,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:58:50,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 8 [2024-10-11 02:58:50,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953763447] [2024-10-11 02:58:50,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:58:50,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 02:58:50,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:58:50,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 02:58:50,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:58:50,093 INFO L87 Difference]: Start difference. First operand 484 states and 696 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-11 02:58:50,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:58:50,179 INFO L93 Difference]: Finished difference Result 879 states and 1279 transitions. [2024-10-11 02:58:50,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 02:58:50,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 69 [2024-10-11 02:58:50,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:58:50,187 INFO L225 Difference]: With dead ends: 879 [2024-10-11 02:58:50,187 INFO L226 Difference]: Without dead ends: 397 [2024-10-11 02:58:50,190 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:58:50,190 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 36 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:58:50,191 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 139 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:58:50,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2024-10-11 02:58:50,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2024-10-11 02:58:50,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 293 states have (on average 1.3037542662116042) internal successors, (382), 313 states have internal predecessors, (382), 54 states have call successors, (54), 48 states have call predecessors, (54), 49 states have return successors, (89), 51 states have call predecessors, (89), 54 states have call successors, (89) [2024-10-11 02:58:50,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 525 transitions. [2024-10-11 02:58:50,223 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 525 transitions. Word has length 69 [2024-10-11 02:58:50,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:58:50,224 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 525 transitions. [2024-10-11 02:58:50,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-11 02:58:50,226 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 525 transitions. [2024-10-11 02:58:50,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-11 02:58:50,228 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:58:50,228 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:58:50,247 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 02:58:50,428 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 02:58:50,429 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:58:50,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:58:50,430 INFO L85 PathProgramCache]: Analyzing trace with hash 2100931381, now seen corresponding path program 1 times [2024-10-11 02:58:50,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:58:50,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295331748] [2024-10-11 02:58:50,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:58:50,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:58:50,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:50,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 02:58:50,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:50,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 02:58:50,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:50,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 02:58:50,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:50,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 02:58:50,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:50,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 02:58:50,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:50,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:58:50,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:50,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 02:58:50,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:50,661 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 02:58:50,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:58:50,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295331748] [2024-10-11 02:58:50,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295331748] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:58:50,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225416125] [2024-10-11 02:58:50,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:58:50,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:58:50,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:58:50,667 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 02:58:50,668 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 02:58:50,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:50,747 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 02:58:50,749 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:58:50,849 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:58:50,850 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:58:50,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1225416125] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:58:50,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:58:50,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2024-10-11 02:58:50,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797265717] [2024-10-11 02:58:50,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:58:50,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:58:50,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:58:50,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:58:50,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:58:50,852 INFO L87 Difference]: Start difference. First operand 397 states and 525 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 02:58:50,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:58:50,989 INFO L93 Difference]: Finished difference Result 998 states and 1356 transitions. [2024-10-11 02:58:50,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 02:58:50,990 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 72 [2024-10-11 02:58:50,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:58:50,994 INFO L225 Difference]: With dead ends: 998 [2024-10-11 02:58:50,994 INFO L226 Difference]: Without dead ends: 603 [2024-10-11 02:58:50,996 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-10-11 02:58:50,996 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 89 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:58:50,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 285 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:58:50,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2024-10-11 02:58:51,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 560. [2024-10-11 02:58:51,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 412 states have (on average 1.296116504854369) internal successors, (534), 439 states have internal predecessors, (534), 77 states have call successors, (77), 71 states have call predecessors, (77), 70 states have return successors, (124), 69 states have call predecessors, (124), 77 states have call successors, (124) [2024-10-11 02:58:51,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 735 transitions. [2024-10-11 02:58:51,041 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 735 transitions. Word has length 72 [2024-10-11 02:58:51,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:58:51,042 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 735 transitions. [2024-10-11 02:58:51,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 02:58:51,042 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 735 transitions. [2024-10-11 02:58:51,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-11 02:58:51,043 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:58:51,043 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:58:51,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 02:58:51,244 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 02:58:51,244 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:58:51,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:58:51,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1771334089, now seen corresponding path program 1 times [2024-10-11 02:58:51,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:58:51,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289786751] [2024-10-11 02:58:51,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:58:51,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:58:51,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:51,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 02:58:51,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:51,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 02:58:51,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:51,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 02:58:51,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:51,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 02:58:51,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:51,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 02:58:51,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:51,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:58:51,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:51,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 02:58:51,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:51,352 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 02:58:51,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:58:51,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289786751] [2024-10-11 02:58:51,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289786751] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:58:51,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18724813] [2024-10-11 02:58:51,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:58:51,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:58:51,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:58:51,355 INFO L229 MonitoredProcess]: Starting monitored process 4 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 02:58:51,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 02:58:51,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:51,436 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 02:58:51,438 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:58:51,459 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 02:58:51,460 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:58:51,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18724813] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:58:51,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:58:51,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-10-11 02:58:51,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323746697] [2024-10-11 02:58:51,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:58:51,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 02:58:51,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:58:51,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 02:58:51,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:58:51,462 INFO L87 Difference]: Start difference. First operand 560 states and 735 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 02:58:51,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:58:51,535 INFO L93 Difference]: Finished difference Result 745 states and 970 transitions. [2024-10-11 02:58:51,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 02:58:51,536 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 72 [2024-10-11 02:58:51,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:58:51,537 INFO L225 Difference]: With dead ends: 745 [2024-10-11 02:58:51,537 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 02:58:51,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:58:51,540 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 0 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:58:51,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 153 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:58:51,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 02:58:51,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 02:58:51,541 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 02:58:51,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 02:58:51,542 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 72 [2024-10-11 02:58:51,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:58:51,543 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 02:58:51,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 02:58:51,543 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 02:58:51,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 02:58:51,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 02:58:51,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 02:58:51,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:58:51,749 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:58:51,751 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 02:58:53,454 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 02:58:53,494 WARN L155 FloydHoareUtils]: Requires clause for timeShift contained old-variable. Original clause: (let ((.cse0 (= |old(~methAndRunningLastTime~0)| 0))) (and (or (not .cse0) (= ~methAndRunningLastTime~0 0)) (= ~pumpRunning~0 |old(~pumpRunning~0)|) (= |old(~waterLevel~0)| ~waterLevel~0) (let ((.cse1 (= 1 ~systemActive~0))) (or (and .cse0 .cse1 (= |old(~pumpRunning~0)| 0) (<= 1 |old(~waterLevel~0)|)) (and .cse1 (<= 2 |old(~waterLevel~0)|) (<= 1 |old(~pumpRunning~0)|)))))) Eliminated clause: (exists ((|old(~methAndRunningLastTime~0)| Int)) (let ((.cse0 (= |old(~methAndRunningLastTime~0)| 0))) (and (or (not .cse0) (= ~methAndRunningLastTime~0 0)) (let ((.cse1 (= 1 ~systemActive~0))) (or (and (<= 1 ~pumpRunning~0) (<= 2 ~waterLevel~0) .cse1) (and (= ~pumpRunning~0 0) .cse0 .cse1 (<= 1 ~waterLevel~0))))))) [2024-10-11 02:58:53,509 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-11 02:58:53,516 WARN L155 FloydHoareUtils]: Requires clause for processEnvironment__wrappee__highWaterSensor contained old-variable. Original clause: (and (= ~pumpRunning~0 0) (= ~methAndRunningLastTime~0 0) (= 1 ~systemActive~0) (= |old(~pumpRunning~0)| 0) (<= 1 ~waterLevel~0)) Eliminated clause: (and (= ~pumpRunning~0 0) (= ~methAndRunningLastTime~0 0) (= 1 ~systemActive~0) (<= 1 ~waterLevel~0)) [2024-10-11 02:58:53,524 WARN L155 FloydHoareUtils]: Requires clause for waterRise contained old-variable. Original clause: (and (= |old(~waterLevel~0)| ~waterLevel~0) (let ((.cse0 (= 1 ~systemActive~0))) (or (and (= ~pumpRunning~0 0) (= ~methAndRunningLastTime~0 0) .cse0 (<= 1 |old(~waterLevel~0)|)) (and (<= 1 ~pumpRunning~0) .cse0 (<= 2 |old(~waterLevel~0)|))))) Eliminated clause: (let ((.cse0 (= 1 ~systemActive~0))) (or (and (= ~pumpRunning~0 0) (= ~methAndRunningLastTime~0 0) .cse0 (<= 1 ~waterLevel~0)) (and (<= 1 ~pumpRunning~0) (<= 2 ~waterLevel~0) .cse0))) [2024-10-11 02:58:53,531 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:58:53 BoogieIcfgContainer [2024-10-11 02:58:53,534 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 02:58:53,535 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 02:58:53,535 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 02:58:53,535 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 02:58:53,536 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:58:46" (3/4) ... [2024-10-11 02:58:53,538 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 02:58:53,541 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base [2024-10-11 02:58:53,541 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2024-10-11 02:58:53,541 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure isMethaneLevelCritical [2024-10-11 02:58:53,541 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure timeShift [2024-10-11 02:58:53,542 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure cleanup [2024-10-11 02:58:53,542 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__highWaterSensor [2024-10-11 02:58:53,542 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure waterRise [2024-10-11 02:58:53,554 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 33 nodes and edges [2024-10-11 02:58:53,554 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2024-10-11 02:58:53,555 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-11 02:58:53,555 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 02:58:53,555 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 02:58:53,675 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 02:58:53,676 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 02:58:53,676 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 02:58:53,676 INFO L158 Benchmark]: Toolchain (without parser) took 8380.21ms. Allocated memory was 159.4MB in the beginning and 247.5MB in the end (delta: 88.1MB). Free memory was 104.5MB in the beginning and 189.4MB in the end (delta: -85.0MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. [2024-10-11 02:58:53,677 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 159.4MB. Free memory is still 120.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 02:58:53,677 INFO L158 Benchmark]: CACSL2BoogieTranslator took 562.26ms. Allocated memory is still 159.4MB. Free memory was 104.5MB in the beginning and 83.0MB in the end (delta: 21.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-11 02:58:53,677 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.31ms. Allocated memory is still 159.4MB. Free memory was 83.0MB in the beginning and 81.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 02:58:53,677 INFO L158 Benchmark]: Boogie Preprocessor took 45.94ms. Allocated memory is still 159.4MB. Free memory was 80.6MB in the beginning and 78.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 02:58:53,677 INFO L158 Benchmark]: RCFGBuilder took 638.82ms. Allocated memory is still 159.4MB. Free memory was 78.5MB in the beginning and 120.6MB in the end (delta: -42.1MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. [2024-10-11 02:58:53,678 INFO L158 Benchmark]: TraceAbstraction took 6918.45ms. Allocated memory was 159.4MB in the beginning and 247.5MB in the end (delta: 88.1MB). Free memory was 119.8MB in the beginning and 196.8MB in the end (delta: -77.0MB). Peak memory consumption was 135.7MB. Max. memory is 16.1GB. [2024-10-11 02:58:53,678 INFO L158 Benchmark]: Witness Printer took 140.91ms. Allocated memory is still 247.5MB. Free memory was 196.8MB in the beginning and 189.4MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-11 02:58:53,679 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.19ms. Allocated memory is still 159.4MB. Free memory is still 120.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 562.26ms. Allocated memory is still 159.4MB. Free memory was 104.5MB in the beginning and 83.0MB in the end (delta: 21.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.31ms. Allocated memory is still 159.4MB. Free memory was 83.0MB in the beginning and 81.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.94ms. Allocated memory is still 159.4MB. Free memory was 80.6MB in the beginning and 78.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 638.82ms. Allocated memory is still 159.4MB. Free memory was 78.5MB in the beginning and 120.6MB in the end (delta: -42.1MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. * TraceAbstraction took 6918.45ms. Allocated memory was 159.4MB in the beginning and 247.5MB in the end (delta: 88.1MB). Free memory was 119.8MB in the beginning and 196.8MB in the end (delta: -77.0MB). Peak memory consumption was 135.7MB. Max. memory is 16.1GB. * Witness Printer took 140.91ms. Allocated memory is still 247.5MB. Free memory was 196.8MB in the beginning and 189.4MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 49]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [49] - GenericResultAtLocation [Line: 87]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [87] - GenericResultAtLocation [Line: 190]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [190] - GenericResultAtLocation [Line: 232]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [232] - GenericResultAtLocation [Line: 340]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [340] - GenericResultAtLocation [Line: 548]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [548] - GenericResultAtLocation [Line: 615]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [615] - GenericResultAtLocation [Line: 981]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [981] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * 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: 986]: 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, 68 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.1s, OverallIterations: 12, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 996 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 975 mSDsluCounter, 1879 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1058 mSDsCounter, 229 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1054 IncrementalHoareTripleChecker+Invalid, 1283 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 229 mSolverCounterUnsat, 821 mSDtfsCounter, 1054 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 367 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=560occurred in iteration=11, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 119 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 684 NumberOfCodeBlocks, 684 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 669 ConstructedInterpolants, 0 QuantifiedInterpolants, 1113 SizeOfPredicates, 3 NumberOfNonLiveVariables, 824 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 15 InterpolantComputations, 12 PerfectInterpolantSequences, 150/156 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: 559]: Loop Invariant Derived loop invariant: (((((1 <= pumpRunning) && (2 <= waterLevel)) && (1 == systemActive)) && (splverifierCounter == 0)) || (((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 == systemActive)) && (splverifierCounter == 0)) && (1 <= waterLevel))) - InvariantResult [Line: 558]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 100]: Loop Invariant Derived loop invariant: 0 - ProcedureContractResult [Line: 371]: Procedure Contract for processEnvironment__wrappee__base Derived contract for procedure processEnvironment__wrappee__base. Requires: ((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 == systemActive)) && (1 <= waterLevel)) Ensures: ((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 == systemActive)) && (1 <= waterLevel)) - ProcedureContractResult [Line: 264]: Procedure Contract for changeMethaneLevel Derived contract for procedure changeMethaneLevel. Requires: (((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 == systemActive)) && (1 <= waterLevel)) || (((1 <= pumpRunning) && (2 <= waterLevel)) && (1 == systemActive))) Ensures: (((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 == systemActive)) && (1 <= waterLevel)) || (((1 <= pumpRunning) && (2 <= waterLevel)) && (1 == systemActive))) - ProcedureContractResult [Line: 276]: Procedure Contract for isMethaneLevelCritical Derived contract for procedure isMethaneLevelCritical. Requires: ((((pumpRunning == 0) && (1 == systemActive)) && (1 <= waterLevel)) || ((((1 <= pumpRunning) && (methAndRunningLastTime == 0)) && (2 <= waterLevel)) && (1 == systemActive))) Ensures: ((((pumpRunning == 0) && (1 == systemActive)) && (1 <= waterLevel)) || ((((1 <= pumpRunning) && (methAndRunningLastTime == 0)) && (2 <= waterLevel)) && (1 == systemActive))) - ProcedureContractResult [Line: 347]: Procedure Contract for timeShift Derived contract for procedure timeShift. Ensures: (((((((\old(pumpRunning) != 0) || (((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (2 <= waterLevel)) && (1 == systemActive)) && (\old(waterLevel) == waterLevel))) || (((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (waterLevel == 1))) || ((((1 <= pumpRunning) && (2 <= waterLevel)) && (1 == systemActive)) && (\old(waterLevel) == waterLevel))) && (((((\old(methAndRunningLastTime) == 0) && (1 == systemActive)) && (\old(pumpRunning) == 0)) && (1 <= \old(waterLevel))) || ((2 <= \old(waterLevel)) && (1 <= \old(pumpRunning))))) && ((((\old(pumpRunning) != 0) || (((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (2 <= waterLevel)) && (1 == systemActive)) && (\old(waterLevel) == waterLevel))) || (\old(waterLevel) < 2)) || ((((1 <= pumpRunning) && (2 <= waterLevel)) && (1 == systemActive)) && (\old(waterLevel) == waterLevel)))) && (((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 == systemActive)) && (1 <= waterLevel)) || (\old(pumpRunning) < 1))) - ProcedureContractResult [Line: 90]: Procedure Contract for cleanup Derived contract for procedure cleanup. Requires: 0 Ensures: 0 - ProcedureContractResult [Line: 379]: Procedure Contract for processEnvironment__wrappee__highWaterSensor Derived contract for procedure processEnvironment__wrappee__highWaterSensor. Requires: ((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 == systemActive)) && (1 <= waterLevel)) Ensures: ((((methAndRunningLastTime == 0) && ((((1 <= pumpRunning) && (2 <= waterLevel)) || ((pumpRunning == 0) && (waterLevel == 1))) || ((pumpRunning == 0) && (2 <= waterLevel)))) && (1 == systemActive)) && (\old(pumpRunning) == 0)) - ProcedureContractResult [Line: 252]: Procedure Contract for waterRise Derived contract for procedure waterRise. Requires: (((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 == systemActive)) && (1 <= waterLevel)) || (((1 <= pumpRunning) && (2 <= waterLevel)) && (1 == systemActive))) Ensures: (((((\old(waterLevel) < 2) || (\old(waterLevel) == waterLevel)) && (2 <= waterLevel)) && (1 == systemActive)) && (((1 <= pumpRunning) && (2 <= \old(waterLevel))) || (((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 <= \old(waterLevel))))) RESULT: Ultimate proved your program to be correct! [2024-10-11 02:58:53,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE