./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 a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product50.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f645b80d4169704e02b3c19c65a00755e1e28cc942f5a2526cd4b4e1dcca30cf --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 19:40:15,872 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 19:40:15,944 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 19:40:15,948 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 19:40:15,949 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 19:40:15,971 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 19:40:15,972 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 19:40:15,972 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 19:40:15,973 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 19:40:15,974 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 19:40:15,974 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 19:40:15,975 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 19:40:15,975 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 19:40:15,976 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 19:40:15,977 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 19:40:15,977 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 19:40:15,977 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 19:40:15,977 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 19:40:15,978 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 19:40:15,978 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 19:40:15,978 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 19:40:15,980 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 19:40:15,980 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 19:40:15,980 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 19:40:15,980 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 19:40:15,981 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 19:40:15,981 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 19:40:15,981 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 19:40:15,981 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 19:40:15,981 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 19:40:15,982 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 19:40:15,982 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 19:40:15,982 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:40:15,982 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 19:40:15,982 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 19:40:15,982 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 19:40:15,982 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 19:40:15,983 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 19:40:15,983 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 19:40:15,983 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 19:40:15,984 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 19:40:15,985 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 19:40:15,985 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f645b80d4169704e02b3c19c65a00755e1e28cc942f5a2526cd4b4e1dcca30cf [2024-10-12 19:40:16,174 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 19:40:16,195 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 19:40:16,199 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 19:40:16,200 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 19:40:16,200 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 19:40:16,201 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-12 19:40:17,468 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 19:40:17,636 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 19:40:17,637 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product50.cil.c [2024-10-12 19:40:17,652 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82fbb2fff/734e682260854176b3c469bdc705a034/FLAGe52fcd721 [2024-10-12 19:40:17,669 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82fbb2fff/734e682260854176b3c469bdc705a034 [2024-10-12 19:40:17,671 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 19:40:17,672 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 19:40:17,674 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 19:40:17,675 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 19:40:17,679 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 19:40:17,679 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:40:17" (1/1) ... [2024-10-12 19:40:17,682 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3def110b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:40:17, skipping insertion in model container [2024-10-12 19:40:17,682 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:40:17" (1/1) ... [2024-10-12 19:40:17,731 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 19:40:17,939 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-12 19:40:17,943 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:40:17,953 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 19:40:17,962 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [49] [2024-10-12 19:40:17,964 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [87] [2024-10-12 19:40:17,964 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [190] [2024-10-12 19:40:17,964 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [232] [2024-10-12 19:40:17,964 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [340] [2024-10-12 19:40:17,964 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [548] [2024-10-12 19:40:17,964 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [615] [2024-10-12 19:40:17,964 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [981] [2024-10-12 19:40:18,031 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-12 19:40:18,032 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:40:18,050 INFO L204 MainTranslator]: Completed translation [2024-10-12 19:40:18,050 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:40:18 WrapperNode [2024-10-12 19:40:18,050 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 19:40:18,051 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 19:40:18,051 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 19:40:18,051 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 19:40:18,057 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:40:18" (1/1) ... [2024-10-12 19:40:18,068 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:40:18" (1/1) ... [2024-10-12 19:40:18,087 INFO L138 Inliner]: procedures = 57, calls = 100, calls flagged for inlining = 24, calls inlined = 21, statements flattened = 209 [2024-10-12 19:40:18,087 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 19:40:18,088 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 19:40:18,088 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 19:40:18,088 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 19:40:18,097 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:40:18" (1/1) ... [2024-10-12 19:40:18,097 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:40:18" (1/1) ... [2024-10-12 19:40:18,099 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:40:18" (1/1) ... [2024-10-12 19:40:18,115 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 19:40:18,116 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:40:18" (1/1) ... [2024-10-12 19:40:18,116 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:40:18" (1/1) ... [2024-10-12 19:40:18,119 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:40:18" (1/1) ... [2024-10-12 19:40:18,130 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:40:18" (1/1) ... [2024-10-12 19:40:18,132 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:40:18" (1/1) ... [2024-10-12 19:40:18,135 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:40:18" (1/1) ... [2024-10-12 19:40:18,137 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 19:40:18,137 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 19:40:18,138 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 19:40:18,138 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 19:40:18,142 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:40:18" (1/1) ... [2024-10-12 19:40:18,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:40:18,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:40:18,173 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 19:40:18,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 19:40:18,211 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 19:40:18,211 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-10-12 19:40:18,211 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-10-12 19:40:18,212 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2024-10-12 19:40:18,212 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2024-10-12 19:40:18,212 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-12 19:40:18,212 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-12 19:40:18,212 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-12 19:40:18,212 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-12 19:40:18,212 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2024-10-12 19:40:18,213 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2024-10-12 19:40:18,213 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-10-12 19:40:18,213 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-10-12 19:40:18,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 19:40:18,213 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-10-12 19:40:18,214 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-10-12 19:40:18,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 19:40:18,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 19:40:18,286 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 19:40:18,288 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 19:40:18,530 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2024-10-12 19:40:18,530 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 19:40:18,593 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 19:40:18,593 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-12 19:40:18,593 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:40:18 BoogieIcfgContainer [2024-10-12 19:40:18,594 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 19:40:18,599 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 19:40:18,599 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 19:40:18,602 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 19:40:18,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 07:40:17" (1/3) ... [2024-10-12 19:40:18,602 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ad0d6eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:40:18, skipping insertion in model container [2024-10-12 19:40:18,603 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:40:18" (2/3) ... [2024-10-12 19:40:18,605 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ad0d6eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:40:18, skipping insertion in model container [2024-10-12 19:40:18,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:40:18" (3/3) ... [2024-10-12 19:40:18,607 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec2_product50.cil.c [2024-10-12 19:40:18,620 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 19:40:18,620 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 19:40:18,664 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 19:40:18,668 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;@79673c18, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 19:40:18,669 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 19:40:18,672 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-12 19:40:18,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-12 19:40:18,679 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:40:18,680 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:40:18,680 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:40:18,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:40:18,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1548485415, now seen corresponding path program 1 times [2024-10-12 19:40:18,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:40:18,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230911552] [2024-10-12 19:40:18,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:40:18,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:40:18,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:40:18,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:40:18,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:40:18,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:40:18,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:40:18,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230911552] [2024-10-12 19:40:18,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230911552] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:40:18,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:40:18,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 19:40:18,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704166564] [2024-10-12 19:40:18,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:40:18,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 19:40:18,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:40:18,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 19:40:18,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 19:40:18,911 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-12 19:40:18,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:40:18,968 INFO L93 Difference]: Finished difference Result 134 states and 195 transitions. [2024-10-12 19:40:18,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 19:40:18,971 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-12 19:40:18,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:40:18,978 INFO L225 Difference]: With dead ends: 134 [2024-10-12 19:40:18,978 INFO L226 Difference]: Without dead ends: 63 [2024-10-12 19:40:18,981 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-12 19:40:18,983 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-12 19:40:18,984 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-12 19:40:18,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-12 19:40:19,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-10-12 19:40:19,015 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-12 19:40:19,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 86 transitions. [2024-10-12 19:40:19,018 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 86 transitions. Word has length 17 [2024-10-12 19:40:19,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:40:19,019 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 86 transitions. [2024-10-12 19:40:19,019 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-12 19:40:19,019 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 86 transitions. [2024-10-12 19:40:19,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-12 19:40:19,021 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:40:19,021 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-12 19:40:19,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 19:40:19,021 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:40:19,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:40:19,022 INFO L85 PathProgramCache]: Analyzing trace with hash -2091235733, now seen corresponding path program 1 times [2024-10-12 19:40:19,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:40:19,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712009131] [2024-10-12 19:40:19,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:40:19,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:40:19,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:40:19,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 19:40:19,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:40:19,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:40:19,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:40:19,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712009131] [2024-10-12 19:40:19,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712009131] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:40:19,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:40:19,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 19:40:19,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479300889] [2024-10-12 19:40:19,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:40:19,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 19:40:19,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:40:19,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 19:40:19,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 19:40:19,113 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-12 19:40:19,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:40:19,143 INFO L93 Difference]: Finished difference Result 99 states and 135 transitions. [2024-10-12 19:40:19,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 19:40:19,143 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-12 19:40:19,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:40:19,144 INFO L225 Difference]: With dead ends: 99 [2024-10-12 19:40:19,144 INFO L226 Difference]: Without dead ends: 55 [2024-10-12 19:40:19,145 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-12 19:40:19,146 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-12 19:40:19,146 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-12 19:40:19,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-12 19:40:19,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-10-12 19:40:19,156 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-12 19:40:19,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 75 transitions. [2024-10-12 19:40:19,160 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 75 transitions. Word has length 18 [2024-10-12 19:40:19,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:40:19,160 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 75 transitions. [2024-10-12 19:40:19,160 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-12 19:40:19,160 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 75 transitions. [2024-10-12 19:40:19,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-12 19:40:19,161 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:40:19,161 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:40:19,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 19:40:19,161 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:40:19,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:40:19,161 INFO L85 PathProgramCache]: Analyzing trace with hash -2070527680, now seen corresponding path program 1 times [2024-10-12 19:40:19,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:40:19,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977326780] [2024-10-12 19:40:19,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:40:19,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:40:19,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:40:19,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:40:19,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:40:19,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:40:19,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:40:19,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977326780] [2024-10-12 19:40:19,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977326780] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:40:19,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:40:19,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 19:40:19,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425689610] [2024-10-12 19:40:19,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:40:19,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 19:40:19,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:40:19,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 19:40:19,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 19:40:19,233 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-12 19:40:19,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:40:19,263 INFO L93 Difference]: Finished difference Result 108 states and 149 transitions. [2024-10-12 19:40:19,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 19:40:19,266 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-12 19:40:19,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:40:19,267 INFO L225 Difference]: With dead ends: 108 [2024-10-12 19:40:19,267 INFO L226 Difference]: Without dead ends: 55 [2024-10-12 19:40:19,268 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-12 19:40:19,270 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-12 19:40:19,271 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-12 19:40:19,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-12 19:40:19,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-10-12 19:40:19,277 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-12 19:40:19,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 74 transitions. [2024-10-12 19:40:19,278 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 74 transitions. Word has length 21 [2024-10-12 19:40:19,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:40:19,278 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 74 transitions. [2024-10-12 19:40:19,278 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-12 19:40:19,278 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 74 transitions. [2024-10-12 19:40:19,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-12 19:40:19,279 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:40:19,279 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-12 19:40:19,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 19:40:19,279 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:40:19,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:40:19,280 INFO L85 PathProgramCache]: Analyzing trace with hash -968540195, now seen corresponding path program 1 times [2024-10-12 19:40:19,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:40:19,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296423854] [2024-10-12 19:40:19,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:40:19,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:40:19,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:40:19,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 19:40:19,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:40:19,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:40:19,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:40:19,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296423854] [2024-10-12 19:40:19,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296423854] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:40:19,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:40:19,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 19:40:19,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906831884] [2024-10-12 19:40:19,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:40:19,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 19:40:19,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:40:19,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 19:40:19,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 19:40:19,359 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-12 19:40:19,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:40:19,428 INFO L93 Difference]: Finished difference Result 147 states and 201 transitions. [2024-10-12 19:40:19,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 19:40:19,429 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-12 19:40:19,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:40:19,430 INFO L225 Difference]: With dead ends: 147 [2024-10-12 19:40:19,430 INFO L226 Difference]: Without dead ends: 94 [2024-10-12 19:40:19,430 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-12 19:40:19,432 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.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:40:19,433 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.1s Time] [2024-10-12 19:40:19,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-12 19:40:19,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2024-10-12 19:40:19,451 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-12 19:40:19,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 122 transitions. [2024-10-12 19:40:19,454 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 122 transitions. Word has length 26 [2024-10-12 19:40:19,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:40:19,455 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 122 transitions. [2024-10-12 19:40:19,455 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-12 19:40:19,455 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 122 transitions. [2024-10-12 19:40:19,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-12 19:40:19,456 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:40:19,457 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-12 19:40:19,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 19:40:19,457 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:40:19,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:40:19,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1185555006, now seen corresponding path program 1 times [2024-10-12 19:40:19,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:40:19,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178846487] [2024-10-12 19:40:19,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:40:19,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:40:19,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:40:19,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:40:19,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:40:19,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 19:40:19,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:40:19,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:40:19,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:40:19,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178846487] [2024-10-12 19:40:19,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178846487] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:40:19,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:40:19,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:40:19,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579715715] [2024-10-12 19:40:19,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:40:19,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:40:19,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:40:19,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:40:19,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:40:19,565 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-12 19:40:19,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:40:19,760 INFO L93 Difference]: Finished difference Result 206 states and 282 transitions. [2024-10-12 19:40:19,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 19:40:19,760 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-12 19:40:19,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:40:19,762 INFO L225 Difference]: With dead ends: 206 [2024-10-12 19:40:19,764 INFO L226 Difference]: Without dead ends: 116 [2024-10-12 19:40:19,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-12 19:40:19,768 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-12 19:40:19,768 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-12 19:40:19,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-10-12 19:40:19,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2024-10-12 19:40:19,779 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-12 19:40:19,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 152 transitions. [2024-10-12 19:40:19,781 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 152 transitions. Word has length 33 [2024-10-12 19:40:19,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:40:19,781 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 152 transitions. [2024-10-12 19:40:19,781 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-12 19:40:19,781 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 152 transitions. [2024-10-12 19:40:19,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-12 19:40:19,782 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:40:19,783 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-12 19:40:19,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 19:40:19,783 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:40:19,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:40:19,784 INFO L85 PathProgramCache]: Analyzing trace with hash 94308672, now seen corresponding path program 1 times [2024-10-12 19:40:19,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:40:19,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619641663] [2024-10-12 19:40:19,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:40:19,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:40:19,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:40:19,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:40:19,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:40:19,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 19:40:19,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:40:19,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:40:19,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:40:19,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619641663] [2024-10-12 19:40:19,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619641663] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:40:19,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:40:19,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 19:40:19,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299350903] [2024-10-12 19:40:19,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:40:19,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 19:40:19,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:40:19,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 19:40:19,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:40:19,851 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-12 19:40:19,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:40:19,961 INFO L93 Difference]: Finished difference Result 230 states and 310 transitions. [2024-10-12 19:40:19,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 19:40:19,961 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-12 19:40:19,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:40:19,964 INFO L225 Difference]: With dead ends: 230 [2024-10-12 19:40:19,966 INFO L226 Difference]: Without dead ends: 118 [2024-10-12 19:40:19,967 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-12 19:40:19,967 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-12 19:40:19,967 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-12 19:40:19,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-12 19:40:19,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2024-10-12 19:40:19,988 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-12 19:40:19,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 154 transitions. [2024-10-12 19:40:19,992 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 154 transitions. Word has length 33 [2024-10-12 19:40:19,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:40:19,992 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 154 transitions. [2024-10-12 19:40:19,992 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-12 19:40:19,992 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 154 transitions. [2024-10-12 19:40:19,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-12 19:40:19,993 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:40:19,993 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-12 19:40:19,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 19:40:19,993 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:40:19,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:40:19,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1521064388, now seen corresponding path program 1 times [2024-10-12 19:40:19,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:40:19,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379967313] [2024-10-12 19:40:19,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:40:19,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:40:20,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:40:20,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:40:20,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:40:20,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 19:40:20,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:40:20,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:40:20,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:40:20,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379967313] [2024-10-12 19:40:20,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379967313] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:40:20,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:40:20,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 19:40:20,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54888956] [2024-10-12 19:40:20,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:40:20,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 19:40:20,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:40:20,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 19:40:20,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:40:20,081 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-12 19:40:20,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:40:20,295 INFO L93 Difference]: Finished difference Result 378 states and 532 transitions. [2024-10-12 19:40:20,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:40:20,295 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-12 19:40:20,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:40:20,298 INFO L225 Difference]: With dead ends: 378 [2024-10-12 19:40:20,298 INFO L226 Difference]: Without dead ends: 264 [2024-10-12 19:40:20,298 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-12 19:40:20,299 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 185 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:40:20,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 236 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 19:40:20,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-10-12 19:40:20,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 254. [2024-10-12 19:40:20,333 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-12 19:40:20,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 348 transitions. [2024-10-12 19:40:20,335 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 348 transitions. Word has length 33 [2024-10-12 19:40:20,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:40:20,337 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 348 transitions. [2024-10-12 19:40:20,337 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-12 19:40:20,337 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 348 transitions. [2024-10-12 19:40:20,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-12 19:40:20,338 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:40:20,338 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-12 19:40:20,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 19:40:20,338 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:40:20,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:40:20,339 INFO L85 PathProgramCache]: Analyzing trace with hash -562769163, now seen corresponding path program 1 times [2024-10-12 19:40:20,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:40:20,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593132046] [2024-10-12 19:40:20,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:40:20,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:40:20,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:40:20,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-12 19:40:20,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:40:20,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 19:40:20,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:40:20,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:40:20,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:40:20,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-12 19:40:20,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:40:20,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:40:20,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:40:20,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593132046] [2024-10-12 19:40:20,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593132046] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:40:20,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:40:20,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:40:20,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614136475] [2024-10-12 19:40:20,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:40:20,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:40:20,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:40:20,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:40:20,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:40:20,431 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-12 19:40:20,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:40:20,689 INFO L93 Difference]: Finished difference Result 559 states and 782 transitions. [2024-10-12 19:40:20,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 19:40:20,689 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-12 19:40:20,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:40:20,693 INFO L225 Difference]: With dead ends: 559 [2024-10-12 19:40:20,693 INFO L226 Difference]: Without dead ends: 307 [2024-10-12 19:40:20,694 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-12 19:40:20,695 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 151 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-12 19:40:20,695 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-12 19:40:20,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-10-12 19:40:20,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 301. [2024-10-12 19:40:20,726 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-12 19:40:20,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 413 transitions. [2024-10-12 19:40:20,729 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 413 transitions. Word has length 40 [2024-10-12 19:40:20,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:40:20,729 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 413 transitions. [2024-10-12 19:40:20,729 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-12 19:40:20,729 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 413 transitions. [2024-10-12 19:40:20,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-12 19:40:20,730 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:40:20,730 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-12 19:40:20,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 19:40:20,730 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:40:20,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:40:20,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1298538402, now seen corresponding path program 1 times [2024-10-12 19:40:20,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:40:20,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579546162] [2024-10-12 19:40:20,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:40:20,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:40:20,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:40:20,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-12 19:40:20,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:40:20,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 19:40:20,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:40:20,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 19:40:20,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:40:20,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:40:20,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:40:20,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579546162] [2024-10-12 19:40:20,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579546162] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:40:20,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:40:20,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 19:40:20,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862725904] [2024-10-12 19:40:20,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:40:20,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 19:40:20,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:40:20,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 19:40:20,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:40:20,793 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-12 19:40:21,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:40:21,019 INFO L93 Difference]: Finished difference Result 540 states and 764 transitions. [2024-10-12 19:40:21,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 19:40:21,019 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-12 19:40:21,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:40:21,022 INFO L225 Difference]: With dead ends: 540 [2024-10-12 19:40:21,022 INFO L226 Difference]: Without dead ends: 538 [2024-10-12 19:40:21,023 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-12 19:40:21,025 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 234 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-12 19:40:21,025 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-12 19:40:21,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2024-10-12 19:40:21,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 484. [2024-10-12 19:40:21,063 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-12 19:40:21,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 696 transitions. [2024-10-12 19:40:21,066 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 696 transitions. Word has length 37 [2024-10-12 19:40:21,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:40:21,066 INFO L471 AbstractCegarLoop]: Abstraction has 484 states and 696 transitions. [2024-10-12 19:40:21,066 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-12 19:40:21,066 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 696 transitions. [2024-10-12 19:40:21,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-12 19:40:21,068 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:40:21,068 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-12 19:40:21,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 19:40:21,068 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:40:21,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:40:21,069 INFO L85 PathProgramCache]: Analyzing trace with hash -816118374, now seen corresponding path program 1 times [2024-10-12 19:40:21,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:40:21,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408450316] [2024-10-12 19:40:21,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:40:21,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:40:21,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:40:21,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-12 19:40:21,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:40:21,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:40:21,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:40:21,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 19:40:21,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:40:21,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 19:40:21,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:40:21,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 19:40:21,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:40:21,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-12 19:40:21,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:40:21,181 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-12 19:40:21,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:40:21,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408450316] [2024-10-12 19:40:21,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408450316] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:40:21,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27608064] [2024-10-12 19:40:21,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:40:21,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:40:21,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:40:21,183 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 19:40:21,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 19:40:21,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:40:21,268 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 19:40:21,273 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:40:21,328 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-12 19:40:21,328 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 19:40:21,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27608064] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:40:21,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 19:40:21,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 8 [2024-10-12 19:40:21,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17682024] [2024-10-12 19:40:21,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:40:21,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 19:40:21,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:40:21,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 19:40:21,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:40:21,329 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-12 19:40:21,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:40:21,378 INFO L93 Difference]: Finished difference Result 879 states and 1279 transitions. [2024-10-12 19:40:21,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 19:40:21,378 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-12 19:40:21,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:40:21,381 INFO L225 Difference]: With dead ends: 879 [2024-10-12 19:40:21,381 INFO L226 Difference]: Without dead ends: 397 [2024-10-12 19:40:21,385 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-12 19:40:21,385 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-12 19:40:21,386 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-12 19:40:21,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2024-10-12 19:40:21,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2024-10-12 19:40:21,417 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-12 19:40:21,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 525 transitions. [2024-10-12 19:40:21,420 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 525 transitions. Word has length 69 [2024-10-12 19:40:21,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:40:21,420 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 525 transitions. [2024-10-12 19:40:21,421 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-12 19:40:21,421 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 525 transitions. [2024-10-12 19:40:21,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-12 19:40:21,422 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:40:21,422 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-12 19:40:21,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-12 19:40:21,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-12 19:40:21,623 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:40:21,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:40:21,624 INFO L85 PathProgramCache]: Analyzing trace with hash 2100931381, now seen corresponding path program 1 times [2024-10-12 19:40:21,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:40:21,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871849473] [2024-10-12 19:40:21,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:40:21,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:40:21,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:40:21,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-12 19:40:21,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:40:21,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:40:21,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:40:21,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 19:40:21,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:40:21,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 19:40:21,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:40:21,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-12 19:40:21,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:40:21,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:40:21,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:40:21,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-12 19:40:21,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:40:21,736 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-12 19:40:21,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:40:21,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871849473] [2024-10-12 19:40:21,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871849473] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:40:21,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697019381] [2024-10-12 19:40:21,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:40:21,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:40:21,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:40:21,740 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 19:40:21,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 19:40:21,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:40:21,804 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-12 19:40:21,806 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:40:21,865 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-12 19:40:21,866 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 19:40:21,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697019381] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:40:21,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 19:40:21,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2024-10-12 19:40:21,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451119119] [2024-10-12 19:40:21,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:40:21,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 19:40:21,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:40:21,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 19:40:21,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-10-12 19:40:21,867 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-12 19:40:21,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:40:21,968 INFO L93 Difference]: Finished difference Result 998 states and 1356 transitions. [2024-10-12 19:40:21,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 19:40:21,968 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-12 19:40:21,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:40:21,971 INFO L225 Difference]: With dead ends: 998 [2024-10-12 19:40:21,971 INFO L226 Difference]: Without dead ends: 603 [2024-10-12 19:40:21,972 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-12 19:40:21,972 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-12 19:40:21,973 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-12 19:40:21,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2024-10-12 19:40:22,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 560. [2024-10-12 19:40:22,019 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-12 19:40:22,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 735 transitions. [2024-10-12 19:40:22,021 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 735 transitions. Word has length 72 [2024-10-12 19:40:22,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:40:22,021 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 735 transitions. [2024-10-12 19:40:22,022 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-12 19:40:22,022 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 735 transitions. [2024-10-12 19:40:22,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-12 19:40:22,022 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:40:22,023 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-12 19:40:22,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 19:40:22,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-12 19:40:22,224 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:40:22,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:40:22,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1771334089, now seen corresponding path program 1 times [2024-10-12 19:40:22,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:40:22,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874094909] [2024-10-12 19:40:22,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:40:22,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:40:22,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:40:22,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-12 19:40:22,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:40:22,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:40:22,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:40:22,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 19:40:22,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:40:22,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 19:40:22,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:40:22,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-12 19:40:22,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:40:22,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:40:22,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:40:22,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-12 19:40:22,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:40:22,304 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-12 19:40:22,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:40:22,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874094909] [2024-10-12 19:40:22,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874094909] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:40:22,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43556039] [2024-10-12 19:40:22,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:40:22,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:40:22,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:40:22,306 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 19:40:22,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-12 19:40:22,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:40:22,369 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 19:40:22,370 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:40:22,387 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-12 19:40:22,387 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 19:40:22,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43556039] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:40:22,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 19:40:22,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-10-12 19:40:22,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215852055] [2024-10-12 19:40:22,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:40:22,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 19:40:22,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:40:22,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 19:40:22,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-12 19:40:22,389 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-12 19:40:22,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:40:22,424 INFO L93 Difference]: Finished difference Result 745 states and 970 transitions. [2024-10-12 19:40:22,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 19:40:22,424 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-12 19:40:22,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:40:22,425 INFO L225 Difference]: With dead ends: 745 [2024-10-12 19:40:22,425 INFO L226 Difference]: Without dead ends: 0 [2024-10-12 19:40:22,426 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-12 19:40:22,427 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-12 19:40:22,427 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-12 19:40:22,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-12 19:40:22,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-12 19:40:22,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 19:40:22,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-12 19:40:22,428 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 72 [2024-10-12 19:40:22,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:40:22,429 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 19:40:22,429 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-12 19:40:22,429 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-12 19:40:22,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-12 19:40:22,431 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 19:40:22,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-12 19:40:22,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:40:22,635 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:40:22,636 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-12 19:40:23,910 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 19:40:23,929 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-12 19:40:23,943 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-12 19:40:23,945 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-12 19:40:23,951 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-12 19:40:23,956 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 07:40:23 BoogieIcfgContainer [2024-10-12 19:40:23,956 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 19:40:23,958 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 19:40:23,958 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 19:40:23,959 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 19:40:23,959 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:40:18" (3/4) ... [2024-10-12 19:40:23,961 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-12 19:40:23,963 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base [2024-10-12 19:40:23,963 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2024-10-12 19:40:23,963 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure isMethaneLevelCritical [2024-10-12 19:40:23,963 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure timeShift [2024-10-12 19:40:23,963 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure cleanup [2024-10-12 19:40:23,963 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__highWaterSensor [2024-10-12 19:40:23,964 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure waterRise [2024-10-12 19:40:23,968 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 33 nodes and edges [2024-10-12 19:40:23,968 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2024-10-12 19:40:23,968 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-12 19:40:23,969 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-12 19:40:23,969 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-12 19:40:24,052 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 19:40:24,052 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-12 19:40:24,052 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 19:40:24,053 INFO L158 Benchmark]: Toolchain (without parser) took 6380.88ms. Allocated memory was 159.4MB in the beginning and 285.2MB in the end (delta: 125.8MB). Free memory was 102.9MB in the beginning and 170.1MB in the end (delta: -67.2MB). Peak memory consumption was 60.3MB. Max. memory is 16.1GB. [2024-10-12 19:40:24,053 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 159.4MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 19:40:24,053 INFO L158 Benchmark]: CACSL2BoogieTranslator took 376.75ms. Allocated memory is still 159.4MB. Free memory was 102.9MB in the beginning and 81.3MB in the end (delta: 21.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-12 19:40:24,053 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.14ms. Allocated memory is still 159.4MB. Free memory was 81.3MB in the beginning and 79.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 19:40:24,054 INFO L158 Benchmark]: Boogie Preprocessor took 49.20ms. Allocated memory is still 159.4MB. Free memory was 79.2MB in the beginning and 77.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 19:40:24,054 INFO L158 Benchmark]: RCFGBuilder took 456.14ms. Allocated memory is still 159.4MB. Free memory was 77.1MB in the beginning and 52.6MB in the end (delta: 24.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-12 19:40:24,054 INFO L158 Benchmark]: TraceAbstraction took 5359.15ms. Allocated memory was 159.4MB in the beginning and 285.2MB in the end (delta: 125.8MB). Free memory was 51.9MB in the beginning and 177.5MB in the end (delta: -125.5MB). Peak memory consumption was 61.6MB. Max. memory is 16.1GB. [2024-10-12 19:40:24,054 INFO L158 Benchmark]: Witness Printer took 94.12ms. Allocated memory is still 285.2MB. Free memory was 177.5MB in the beginning and 170.1MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-12 19:40:24,055 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 159.4MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 376.75ms. Allocated memory is still 159.4MB. Free memory was 102.9MB in the beginning and 81.3MB in the end (delta: 21.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.14ms. Allocated memory is still 159.4MB. Free memory was 81.3MB in the beginning and 79.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.20ms. Allocated memory is still 159.4MB. Free memory was 79.2MB in the beginning and 77.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 456.14ms. Allocated memory is still 159.4MB. Free memory was 77.1MB in the beginning and 52.6MB in the end (delta: 24.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 5359.15ms. Allocated memory was 159.4MB in the beginning and 285.2MB in the end (delta: 125.8MB). Free memory was 51.9MB in the beginning and 177.5MB in the end (delta: -125.5MB). Peak memory consumption was 61.6MB. Max. memory is 16.1GB. * Witness Printer took 94.12ms. Allocated memory is still 285.2MB. Free memory was 177.5MB in the beginning and 170.1MB 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: 4.0s, OverallIterations: 12, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 996 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 975 mSDsluCounter, 1877 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1057 mSDsCounter, 229 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1053 IncrementalHoareTripleChecker+Invalid, 1282 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 229 mSolverCounterUnsat, 820 mSDtfsCounter, 1053 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.3s 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.2s SatisfiabilityAnalysisTime, 1.0s 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-12 19:40:24,077 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE