./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_spec3_product54.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_spec3_product54.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 cbcb1e9315abec7fabb6a689d6a1c811fb94154c71589df191460c14d014c3cb --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 19:41:16,056 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 19:41:16,125 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 19:41:16,131 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 19:41:16,132 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 19:41:16,158 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 19:41:16,159 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 19:41:16,160 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 19:41:16,160 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 19:41:16,163 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 19:41:16,163 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 19:41:16,164 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 19:41:16,164 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 19:41:16,164 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 19:41:16,165 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 19:41:16,165 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 19:41:16,165 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 19:41:16,166 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 19:41:16,166 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 19:41:16,168 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 19:41:16,169 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 19:41:16,169 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 19:41:16,169 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 19:41:16,170 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 19:41:16,170 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 19:41:16,170 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 19:41:16,170 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 19:41:16,171 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 19:41:16,171 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 19:41:16,171 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 19:41:16,171 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 19:41:16,172 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 19:41:16,172 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:41:16,172 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 19:41:16,172 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 19:41:16,172 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 19:41:16,173 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 19:41:16,173 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 19:41:16,174 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 19:41:16,174 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 19:41:16,175 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 19:41:16,175 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 19:41:16,176 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 -> cbcb1e9315abec7fabb6a689d6a1c811fb94154c71589df191460c14d014c3cb [2024-10-12 19:41:16,440 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 19:41:16,466 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 19:41:16,470 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 19:41:16,471 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 19:41:16,472 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 19:41:16,473 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec3_product54.cil.c [2024-10-12 19:41:17,895 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 19:41:18,122 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 19:41:18,123 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec3_product54.cil.c [2024-10-12 19:41:18,138 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43718060d/7455842d8c174791b3f6b407fd8b1baa/FLAG3f9ebd5b6 [2024-10-12 19:41:18,465 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43718060d/7455842d8c174791b3f6b407fd8b1baa [2024-10-12 19:41:18,467 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 19:41:18,468 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 19:41:18,469 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 19:41:18,469 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 19:41:18,476 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 19:41:18,477 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:41:18" (1/1) ... [2024-10-12 19:41:18,478 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44b90537 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:41:18, skipping insertion in model container [2024-10-12 19:41:18,478 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:41:18" (1/1) ... [2024-10-12 19:41:18,517 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 19:41:18,737 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_spec3_product54.cil.c[4478,4491] [2024-10-12 19:41:18,829 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:41:18,852 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 19:41:18,862 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [49] [2024-10-12 19:41:18,864 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [160] [2024-10-12 19:41:18,864 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [262] [2024-10-12 19:41:18,864 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [271] [2024-10-12 19:41:18,864 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [306] [2024-10-12 19:41:18,865 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [341] [2024-10-12 19:41:18,865 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [707] [2024-10-12 19:41:18,865 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [775] [2024-10-12 19:41:18,882 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_spec3_product54.cil.c[4478,4491] [2024-10-12 19:41:18,939 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:41:18,961 INFO L204 MainTranslator]: Completed translation [2024-10-12 19:41:18,962 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:41:18 WrapperNode [2024-10-12 19:41:18,962 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 19:41:18,963 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 19:41:18,963 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 19:41:18,963 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 19:41:18,970 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:41:18" (1/1) ... [2024-10-12 19:41:18,980 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:41:18" (1/1) ... [2024-10-12 19:41:19,011 INFO L138 Inliner]: procedures = 57, calls = 104, calls flagged for inlining = 24, calls inlined = 21, statements flattened = 231 [2024-10-12 19:41:19,011 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 19:41:19,012 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 19:41:19,015 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 19:41:19,016 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 19:41:19,025 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:41:18" (1/1) ... [2024-10-12 19:41:19,026 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:41:18" (1/1) ... [2024-10-12 19:41:19,029 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:41:18" (1/1) ... [2024-10-12 19:41:19,044 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:41:19,044 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:41:18" (1/1) ... [2024-10-12 19:41:19,045 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:41:18" (1/1) ... [2024-10-12 19:41:19,049 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:41:18" (1/1) ... [2024-10-12 19:41:19,053 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:41:18" (1/1) ... [2024-10-12 19:41:19,055 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:41:18" (1/1) ... [2024-10-12 19:41:19,056 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:41:18" (1/1) ... [2024-10-12 19:41:19,058 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 19:41:19,059 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 19:41:19,059 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 19:41:19,059 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 19:41:19,064 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:41:18" (1/1) ... [2024-10-12 19:41:19,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:41:19,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:41:19,103 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:41:19,110 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:41:19,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 19:41:19,151 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-10-12 19:41:19,151 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-10-12 19:41:19,151 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-12 19:41:19,151 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-12 19:41:19,151 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-12 19:41:19,151 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-12 19:41:19,151 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2024-10-12 19:41:19,151 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2024-10-12 19:41:19,152 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2024-10-12 19:41:19,152 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2024-10-12 19:41:19,152 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-10-12 19:41:19,152 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-10-12 19:41:19,152 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__lowWaterSensor [2024-10-12 19:41:19,152 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__lowWaterSensor [2024-10-12 19:41:19,152 INFO L130 BoogieDeclarations]: Found specification of procedure deactivatePump [2024-10-12 19:41:19,152 INFO L138 BoogieDeclarations]: Found implementation of procedure deactivatePump [2024-10-12 19:41:19,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 19:41:19,153 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-10-12 19:41:19,153 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-10-12 19:41:19,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 19:41:19,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 19:41:19,234 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 19:41:19,236 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 19:41:19,522 INFO L? ?]: Removed 53 outVars from TransFormulas that were not future-live. [2024-10-12 19:41:19,522 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 19:41:19,575 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 19:41:19,575 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-12 19:41:19,576 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:41:19 BoogieIcfgContainer [2024-10-12 19:41:19,576 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 19:41:19,578 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 19:41:19,578 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 19:41:19,582 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 19:41:19,582 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 07:41:18" (1/3) ... [2024-10-12 19:41:19,583 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56b6264a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:41:19, skipping insertion in model container [2024-10-12 19:41:19,583 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:41:18" (2/3) ... [2024-10-12 19:41:19,584 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56b6264a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:41:19, skipping insertion in model container [2024-10-12 19:41:19,584 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:41:19" (3/3) ... [2024-10-12 19:41:19,586 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec3_product54.cil.c [2024-10-12 19:41:19,600 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 19:41:19,600 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 19:41:19,659 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 19:41:19,665 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;@481aaf45, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 19:41:19,666 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 19:41:19,671 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 54 states have (on average 1.537037037037037) internal successors, (83), 64 states have internal predecessors, (83), 16 states have call successors, (16), 9 states have call predecessors, (16), 9 states have return successors, (16), 11 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-12 19:41:19,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-12 19:41:19,681 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:41:19,682 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:41:19,683 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:41:19,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:41:19,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1601004383, now seen corresponding path program 1 times [2024-10-12 19:41:19,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:41:19,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596677229] [2024-10-12 19:41:19,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:41:19,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:41:19,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:19,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:41:19,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:19,953 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:41:19,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:41:19,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596677229] [2024-10-12 19:41:19,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596677229] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:41:19,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:41:19,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 19:41:19,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194146285] [2024-10-12 19:41:19,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:41:19,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 19:41:19,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:41:19,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 19:41:19,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 19:41:19,990 INFO L87 Difference]: Start difference. First operand has 81 states, 54 states have (on average 1.537037037037037) internal successors, (83), 64 states have internal predecessors, (83), 16 states have call successors, (16), 9 states have call predecessors, (16), 9 states have return successors, (16), 11 states have call predecessors, (16), 16 states have call successors, (16) 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:41:20,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:41:20,065 INFO L93 Difference]: Finished difference Result 160 states and 231 transitions. [2024-10-12 19:41:20,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 19:41:20,068 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:41:20,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:41:20,079 INFO L225 Difference]: With dead ends: 160 [2024-10-12 19:41:20,080 INFO L226 Difference]: Without dead ends: 76 [2024-10-12 19:41:20,084 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:41:20,089 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:41:20,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 93 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:41:20,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-12 19:41:20,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-10-12 19:41:20,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 60 states have internal predecessors, (73), 16 states have call successors, (16), 9 states have call predecessors, (16), 8 states have return successors, (15), 10 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-12 19:41:20,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 104 transitions. [2024-10-12 19:41:20,146 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 104 transitions. Word has length 17 [2024-10-12 19:41:20,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:41:20,148 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 104 transitions. [2024-10-12 19:41:20,148 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:41:20,148 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 104 transitions. [2024-10-12 19:41:20,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-12 19:41:20,152 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:41:20,152 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:41:20,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 19:41:20,153 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:41:20,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:41:20,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1042531106, now seen corresponding path program 1 times [2024-10-12 19:41:20,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:41:20,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465098580] [2024-10-12 19:41:20,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:41:20,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:41:20,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:20,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 19:41:20,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:20,287 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:41:20,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:41:20,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465098580] [2024-10-12 19:41:20,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465098580] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:41:20,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:41:20,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 19:41:20,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314689142] [2024-10-12 19:41:20,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:41:20,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 19:41:20,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:41:20,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 19:41:20,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 19:41:20,292 INFO L87 Difference]: Start difference. First operand 76 states and 104 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:41:20,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:41:20,354 INFO L93 Difference]: Finished difference Result 125 states and 171 transitions. [2024-10-12 19:41:20,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 19:41:20,355 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:41:20,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:41:20,357 INFO L225 Difference]: With dead ends: 125 [2024-10-12 19:41:20,357 INFO L226 Difference]: Without dead ends: 68 [2024-10-12 19:41:20,358 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:41:20,361 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 11 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:41:20,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 145 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:41:20,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-12 19:41:20,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-10-12 19:41:20,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 46 states have (on average 1.4565217391304348) internal successors, (67), 55 states have internal predecessors, (67), 13 states have call successors, (13), 8 states have call predecessors, (13), 8 states have return successors, (13), 8 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-12 19:41:20,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 93 transitions. [2024-10-12 19:41:20,380 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 93 transitions. Word has length 18 [2024-10-12 19:41:20,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:41:20,380 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 93 transitions. [2024-10-12 19:41:20,381 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:41:20,381 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 93 transitions. [2024-10-12 19:41:20,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-12 19:41:20,382 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:41:20,382 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:41:20,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 19:41:20,384 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:41:20,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:41:20,386 INFO L85 PathProgramCache]: Analyzing trace with hash 411574839, now seen corresponding path program 1 times [2024-10-12 19:41:20,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:41:20,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672533487] [2024-10-12 19:41:20,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:41:20,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:41:20,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:20,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:41:20,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:20,485 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:41:20,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:41:20,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672533487] [2024-10-12 19:41:20,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672533487] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:41:20,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:41:20,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 19:41:20,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469054875] [2024-10-12 19:41:20,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:41:20,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 19:41:20,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:41:20,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 19:41:20,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 19:41:20,493 INFO L87 Difference]: Start difference. First operand 68 states and 93 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:41:20,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:41:20,539 INFO L93 Difference]: Finished difference Result 134 states and 185 transitions. [2024-10-12 19:41:20,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 19:41:20,541 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:41:20,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:41:20,543 INFO L225 Difference]: With dead ends: 134 [2024-10-12 19:41:20,543 INFO L226 Difference]: Without dead ends: 68 [2024-10-12 19:41:20,544 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:41:20,546 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 88 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:41:20,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 77 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:41:20,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-12 19:41:20,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-10-12 19:41:20,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 46 states have (on average 1.434782608695652) internal successors, (66), 55 states have internal predecessors, (66), 13 states have call successors, (13), 8 states have call predecessors, (13), 8 states have return successors, (13), 8 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-12 19:41:20,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 92 transitions. [2024-10-12 19:41:20,567 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 92 transitions. Word has length 21 [2024-10-12 19:41:20,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:41:20,567 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 92 transitions. [2024-10-12 19:41:20,567 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:41:20,569 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 92 transitions. [2024-10-12 19:41:20,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-12 19:41:20,570 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:41:20,571 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:41:20,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 19:41:20,572 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:41:20,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:41:20,572 INFO L85 PathProgramCache]: Analyzing trace with hash 2090515431, now seen corresponding path program 1 times [2024-10-12 19:41:20,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:41:20,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826916705] [2024-10-12 19:41:20,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:41:20,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:41:20,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:20,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:41:20,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:20,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 19:41:20,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:20,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 19:41:20,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:20,658 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 19:41:20,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:41:20,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826916705] [2024-10-12 19:41:20,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826916705] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:41:20,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:41:20,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 19:41:20,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827915791] [2024-10-12 19:41:20,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:41:20,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 19:41:20,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:41:20,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 19:41:20,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 19:41:20,661 INFO L87 Difference]: Start difference. First operand 68 states and 92 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (4), 3 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:41:20,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:41:20,901 INFO L93 Difference]: Finished difference Result 205 states and 279 transitions. [2024-10-12 19:41:20,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 19:41:20,904 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (4), 3 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 31 [2024-10-12 19:41:20,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:41:20,906 INFO L225 Difference]: With dead ends: 205 [2024-10-12 19:41:20,906 INFO L226 Difference]: Without dead ends: 139 [2024-10-12 19:41:20,907 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:41:20,908 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 134 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:41:20,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 148 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 19:41:20,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-10-12 19:41:20,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 133. [2024-10-12 19:41:20,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 93 states have (on average 1.3763440860215055) internal successors, (128), 101 states have internal predecessors, (128), 19 states have call successors, (19), 15 states have call predecessors, (19), 20 states have return successors, (30), 21 states have call predecessors, (30), 19 states have call successors, (30) [2024-10-12 19:41:20,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 177 transitions. [2024-10-12 19:41:20,938 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 177 transitions. Word has length 31 [2024-10-12 19:41:20,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:41:20,938 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 177 transitions. [2024-10-12 19:41:20,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (4), 3 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:41:20,939 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 177 transitions. [2024-10-12 19:41:20,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-12 19:41:20,939 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:41:20,940 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] [2024-10-12 19:41:20,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 19:41:20,940 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:41:20,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:41:20,943 INFO L85 PathProgramCache]: Analyzing trace with hash -181130615, now seen corresponding path program 1 times [2024-10-12 19:41:20,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:41:20,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194693830] [2024-10-12 19:41:20,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:41:20,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:41:20,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:21,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:41:21,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:21,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:41:21,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:21,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-12 19:41:21,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:21,074 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:41:21,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:41:21,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194693830] [2024-10-12 19:41:21,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194693830] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:41:21,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:41:21,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 19:41:21,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935238274] [2024-10-12 19:41:21,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:41:21,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 19:41:21,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:41:21,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 19:41:21,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:41:21,077 INFO L87 Difference]: Start difference. First operand 133 states and 177 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 19:41:21,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:41:21,236 INFO L93 Difference]: Finished difference Result 268 states and 362 transitions. [2024-10-12 19:41:21,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 19:41:21,236 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2024-10-12 19:41:21,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:41:21,238 INFO L225 Difference]: With dead ends: 268 [2024-10-12 19:41:21,238 INFO L226 Difference]: Without dead ends: 137 [2024-10-12 19:41:21,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 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:41:21,240 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 52 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:41:21,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 222 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:41:21,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-10-12 19:41:21,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2024-10-12 19:41:21,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 95 states have (on average 1.368421052631579) internal successors, (130), 103 states have internal predecessors, (130), 19 states have call successors, (19), 15 states have call predecessors, (19), 20 states have return successors, (30), 21 states have call predecessors, (30), 19 states have call successors, (30) [2024-10-12 19:41:21,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 179 transitions. [2024-10-12 19:41:21,257 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 179 transitions. Word has length 38 [2024-10-12 19:41:21,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:41:21,258 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 179 transitions. [2024-10-12 19:41:21,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 19:41:21,258 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 179 transitions. [2024-10-12 19:41:21,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-12 19:41:21,259 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:41:21,259 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] [2024-10-12 19:41:21,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 19:41:21,260 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:41:21,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:41:21,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1769478517, now seen corresponding path program 1 times [2024-10-12 19:41:21,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:41:21,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667650615] [2024-10-12 19:41:21,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:41:21,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:41:21,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:21,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:41:21,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:21,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:41:21,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:21,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-12 19:41:21,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:21,384 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:41:21,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:41:21,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667650615] [2024-10-12 19:41:21,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667650615] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:41:21,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:41:21,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:41:21,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362879796] [2024-10-12 19:41:21,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:41:21,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:41:21,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:41:21,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:41:21,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:41:21,387 INFO L87 Difference]: Start difference. First operand 135 states and 179 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 19:41:21,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:41:21,593 INFO L93 Difference]: Finished difference Result 272 states and 372 transitions. [2024-10-12 19:41:21,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 19:41:21,594 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2024-10-12 19:41:21,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:41:21,596 INFO L225 Difference]: With dead ends: 272 [2024-10-12 19:41:21,596 INFO L226 Difference]: Without dead ends: 139 [2024-10-12 19:41:21,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 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:41:21,597 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 127 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:41:21,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 204 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 19:41:21,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-10-12 19:41:21,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 137. [2024-10-12 19:41:21,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 97 states have (on average 1.3608247422680413) internal successors, (132), 105 states have internal predecessors, (132), 19 states have call successors, (19), 15 states have call predecessors, (19), 20 states have return successors, (30), 21 states have call predecessors, (30), 19 states have call successors, (30) [2024-10-12 19:41:21,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 181 transitions. [2024-10-12 19:41:21,614 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 181 transitions. Word has length 38 [2024-10-12 19:41:21,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:41:21,614 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 181 transitions. [2024-10-12 19:41:21,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 19:41:21,615 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 181 transitions. [2024-10-12 19:41:21,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-12 19:41:21,616 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:41:21,616 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] [2024-10-12 19:41:21,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 19:41:21,616 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:41:21,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:41:21,617 INFO L85 PathProgramCache]: Analyzing trace with hash 836545037, now seen corresponding path program 1 times [2024-10-12 19:41:21,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:41:21,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641878697] [2024-10-12 19:41:21,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:41:21,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:41:21,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:21,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:41:21,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:21,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:41:21,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:21,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-12 19:41:21,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:21,712 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:41:21,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:41:21,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641878697] [2024-10-12 19:41:21,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641878697] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:41:21,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:41:21,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 19:41:21,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567505640] [2024-10-12 19:41:21,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:41:21,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 19:41:21,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:41:21,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 19:41:21,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:41:21,715 INFO L87 Difference]: Start difference. First operand 137 states and 181 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 19:41:21,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:41:21,956 INFO L93 Difference]: Finished difference Result 395 states and 539 transitions. [2024-10-12 19:41:21,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:41:21,957 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 38 [2024-10-12 19:41:21,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:41:21,959 INFO L225 Difference]: With dead ends: 395 [2024-10-12 19:41:21,959 INFO L226 Difference]: Without dead ends: 260 [2024-10-12 19:41:21,960 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 1 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:41:21,961 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 199 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:41:21,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 230 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 19:41:21,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-10-12 19:41:22,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 252. [2024-10-12 19:41:22,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 179 states have (on average 1.318435754189944) internal successors, (236), 191 states have internal predecessors, (236), 36 states have call successors, (36), 33 states have call predecessors, (36), 36 states have return successors, (62), 37 states have call predecessors, (62), 36 states have call successors, (62) [2024-10-12 19:41:22,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 334 transitions. [2024-10-12 19:41:22,008 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 334 transitions. Word has length 38 [2024-10-12 19:41:22,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:41:22,009 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 334 transitions. [2024-10-12 19:41:22,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 19:41:22,009 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 334 transitions. [2024-10-12 19:41:22,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-12 19:41:22,011 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:41:22,011 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, 1] [2024-10-12 19:41:22,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 19:41:22,012 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:41:22,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:41:22,012 INFO L85 PathProgramCache]: Analyzing trace with hash -503695203, now seen corresponding path program 1 times [2024-10-12 19:41:22,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:41:22,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854403314] [2024-10-12 19:41:22,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:41:22,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:41:22,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:22,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:41:22,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:22,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:41:22,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:22,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:41:22,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:22,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-12 19:41:22,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:22,089 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:41:22,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:41:22,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854403314] [2024-10-12 19:41:22,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854403314] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:41:22,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:41:22,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 19:41:22,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429549020] [2024-10-12 19:41:22,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:41:22,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 19:41:22,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:41:22,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 19:41:22,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:41:22,091 INFO L87 Difference]: Start difference. First operand 252 states and 334 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-12 19:41:22,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:41:22,277 INFO L93 Difference]: Finished difference Result 503 states and 666 transitions. [2024-10-12 19:41:22,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 19:41:22,278 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2024-10-12 19:41:22,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:41:22,280 INFO L225 Difference]: With dead ends: 503 [2024-10-12 19:41:22,281 INFO L226 Difference]: Without dead ends: 253 [2024-10-12 19:41:22,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:41:22,283 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 104 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:41:22,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 195 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:41:22,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-10-12 19:41:22,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 251. [2024-10-12 19:41:22,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 178 states have (on average 1.3089887640449438) internal successors, (233), 190 states have internal predecessors, (233), 36 states have call successors, (36), 33 states have call predecessors, (36), 36 states have return successors, (62), 37 states have call predecessors, (62), 36 states have call successors, (62) [2024-10-12 19:41:22,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 331 transitions. [2024-10-12 19:41:22,309 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 331 transitions. Word has length 41 [2024-10-12 19:41:22,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:41:22,310 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 331 transitions. [2024-10-12 19:41:22,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-12 19:41:22,310 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 331 transitions. [2024-10-12 19:41:22,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-12 19:41:22,311 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:41:22,311 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, 1, 1] [2024-10-12 19:41:22,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 19:41:22,312 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:41:22,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:41:22,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1598886413, now seen corresponding path program 1 times [2024-10-12 19:41:22,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:41:22,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836734377] [2024-10-12 19:41:22,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:41:22,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:41:22,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:22,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-12 19:41:22,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:22,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 19:41:22,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:22,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:41:22,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:22,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 19:41:22,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:22,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:41:22,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:41:22,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836734377] [2024-10-12 19:41:22,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836734377] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:41:22,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:41:22,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:41:22,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92789773] [2024-10-12 19:41:22,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:41:22,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:41:22,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:41:22,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:41:22,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:41:22,407 INFO L87 Difference]: Start difference. First operand 251 states and 331 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-12 19:41:22,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:41:22,779 INFO L93 Difference]: Finished difference Result 486 states and 653 transitions. [2024-10-12 19:41:22,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 19:41:22,780 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 42 [2024-10-12 19:41:22,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:41:22,782 INFO L225 Difference]: With dead ends: 486 [2024-10-12 19:41:22,782 INFO L226 Difference]: Without dead ends: 283 [2024-10-12 19:41:22,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2024-10-12 19:41:22,786 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 188 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 19:41:22,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 236 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 19:41:22,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-10-12 19:41:22,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 279. [2024-10-12 19:41:22,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 198 states have (on average 1.2727272727272727) internal successors, (252), 213 states have internal predecessors, (252), 41 states have call successors, (41), 33 states have call predecessors, (41), 39 states have return successors, (58), 42 states have call predecessors, (58), 41 states have call successors, (58) [2024-10-12 19:41:22,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 351 transitions. [2024-10-12 19:41:22,820 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 351 transitions. Word has length 42 [2024-10-12 19:41:22,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:41:22,820 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 351 transitions. [2024-10-12 19:41:22,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-12 19:41:22,821 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 351 transitions. [2024-10-12 19:41:22,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-12 19:41:22,821 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:41:22,821 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, 1, 1, 1, 1, 1] [2024-10-12 19:41:22,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 19:41:22,822 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:41:22,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:41:22,822 INFO L85 PathProgramCache]: Analyzing trace with hash 659363893, now seen corresponding path program 1 times [2024-10-12 19:41:22,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:41:22,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018705553] [2024-10-12 19:41:22,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:41:22,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:41:22,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:22,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-12 19:41:22,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:22,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 19:41:22,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:22,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:41:22,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:22,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:41:22,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:22,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 19:41:22,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:22,889 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:41:22,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:41:22,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018705553] [2024-10-12 19:41:22,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018705553] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:41:22,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:41:22,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:41:22,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67053966] [2024-10-12 19:41:22,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:41:22,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:41:22,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:41:22,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:41:22,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:41:22,893 INFO L87 Difference]: Start difference. First operand 279 states and 351 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:41:23,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:41:23,138 INFO L93 Difference]: Finished difference Result 510 states and 652 transitions. [2024-10-12 19:41:23,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:41:23,138 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 45 [2024-10-12 19:41:23,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:41:23,140 INFO L225 Difference]: With dead ends: 510 [2024-10-12 19:41:23,140 INFO L226 Difference]: Without dead ends: 281 [2024-10-12 19:41:23,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 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:41:23,142 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 121 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:41:23,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 166 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 19:41:23,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-10-12 19:41:23,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 277. [2024-10-12 19:41:23,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 196 states have (on average 1.2704081632653061) internal successors, (249), 211 states have internal predecessors, (249), 41 states have call successors, (41), 33 states have call predecessors, (41), 39 states have return successors, (58), 42 states have call predecessors, (58), 41 states have call successors, (58) [2024-10-12 19:41:23,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 348 transitions. [2024-10-12 19:41:23,171 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 348 transitions. Word has length 45 [2024-10-12 19:41:23,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:41:23,171 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 348 transitions. [2024-10-12 19:41:23,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:41:23,171 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 348 transitions. [2024-10-12 19:41:23,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-12 19:41:23,172 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:41:23,172 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, 1, 1, 1, 1, 1] [2024-10-12 19:41:23,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 19:41:23,172 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:41:23,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:41:23,173 INFO L85 PathProgramCache]: Analyzing trace with hash -158284557, now seen corresponding path program 1 times [2024-10-12 19:41:23,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:41:23,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008842216] [2024-10-12 19:41:23,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:41:23,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:41:23,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:23,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-12 19:41:23,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:23,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 19:41:23,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:23,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:41:23,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:23,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:41:23,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:23,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 19:41:23,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:23,268 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:41:23,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:41:23,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008842216] [2024-10-12 19:41:23,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008842216] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:41:23,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:41:23,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:41:23,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961944115] [2024-10-12 19:41:23,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:41:23,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:41:23,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:41:23,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:41:23,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:41:23,273 INFO L87 Difference]: Start difference. First operand 277 states and 348 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:41:23,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:41:23,532 INFO L93 Difference]: Finished difference Result 485 states and 617 transitions. [2024-10-12 19:41:23,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:41:23,533 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 45 [2024-10-12 19:41:23,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:41:23,535 INFO L225 Difference]: With dead ends: 485 [2024-10-12 19:41:23,535 INFO L226 Difference]: Without dead ends: 258 [2024-10-12 19:41:23,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 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:41:23,536 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 119 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:41:23,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 175 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 19:41:23,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-10-12 19:41:23,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 254. [2024-10-12 19:41:23,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 181 states have (on average 1.2651933701657458) internal successors, (229), 195 states have internal predecessors, (229), 38 states have call successors, (38), 30 states have call predecessors, (38), 34 states have return successors, (49), 37 states have call predecessors, (49), 38 states have call successors, (49) [2024-10-12 19:41:23,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 316 transitions. [2024-10-12 19:41:23,557 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 316 transitions. Word has length 45 [2024-10-12 19:41:23,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:41:23,557 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 316 transitions. [2024-10-12 19:41:23,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:41:23,558 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 316 transitions. [2024-10-12 19:41:23,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-12 19:41:23,559 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:41:23,559 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:41:23,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 19:41:23,559 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:41:23,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:41:23,560 INFO L85 PathProgramCache]: Analyzing trace with hash -823320859, now seen corresponding path program 1 times [2024-10-12 19:41:23,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:41:23,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073890968] [2024-10-12 19:41:23,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:41:23,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:41:23,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:23,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-12 19:41:23,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:23,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:41:23,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:23,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 19:41:23,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:23,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:41:23,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:23,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 19:41:23,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:23,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-12 19:41:23,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:23,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 19:41:23,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:23,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-12 19:41:23,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:23,796 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-12 19:41:23,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:41:23,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073890968] [2024-10-12 19:41:23,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073890968] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:41:23,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043158942] [2024-10-12 19:41:23,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:41:23,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:41:23,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:41:23,799 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:41:23,800 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:41:23,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:23,884 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-12 19:41:23,891 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:41:24,029 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-12 19:41:24,029 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:41:24,316 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-12 19:41:24,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2043158942] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 19:41:24,317 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 19:41:24,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 14 [2024-10-12 19:41:24,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241287961] [2024-10-12 19:41:24,317 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 19:41:24,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-12 19:41:24,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:41:24,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-12 19:41:24,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2024-10-12 19:41:24,319 INFO L87 Difference]: Start difference. First operand 254 states and 316 transitions. Second operand has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 11 states have internal predecessors, (79), 7 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (19), 6 states have call predecessors, (19), 7 states have call successors, (19) [2024-10-12 19:41:24,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:41:24,838 INFO L93 Difference]: Finished difference Result 481 states and 630 transitions. [2024-10-12 19:41:24,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-12 19:41:24,839 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 11 states have internal predecessors, (79), 7 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (19), 6 states have call predecessors, (19), 7 states have call successors, (19) Word has length 72 [2024-10-12 19:41:24,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:41:24,840 INFO L225 Difference]: With dead ends: 481 [2024-10-12 19:41:24,840 INFO L226 Difference]: Without dead ends: 0 [2024-10-12 19:41:24,842 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 152 SyntacticMatches, 6 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=245, Invalid=457, Unknown=0, NotChecked=0, Total=702 [2024-10-12 19:41:24,842 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 457 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 19:41:24,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 175 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 19:41:24,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-12 19:41:24,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-12 19:41:24,843 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:41:24,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-12 19:41:24,844 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 72 [2024-10-12 19:41:24,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:41:24,844 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 19:41:24,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 11 states have internal predecessors, (79), 7 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (19), 6 states have call predecessors, (19), 7 states have call successors, (19) [2024-10-12 19:41:24,844 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-12 19:41:24,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-12 19:41:24,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 19:41:24,865 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:41:25,051 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,SelfDestructingSolverStorable11 [2024-10-12 19:41:25,055 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:41:25,057 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-12 19:41:27,222 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 19:41:27,238 WARN L155 FloydHoareUtils]: Requires clause for deactivatePump contained old-variable. Original clause: (and (<= ~waterLevel~0 1) (= 1 ~systemActive~0) (= |old(~pumpRunning~0)| 1) (= ~pumpRunning~0 1)) Eliminated clause: (and (<= ~waterLevel~0 1) (= 1 ~systemActive~0) (= ~pumpRunning~0 1)) [2024-10-12 19:41:27,251 WARN L155 FloydHoareUtils]: Requires clause for timeShift contained old-variable. Original clause: (let ((.cse0 (= |old(~pumpRunning~0)| 0)) (.cse3 (= |old(~pumpRunning~0)| 1)) (.cse1 (= |old(~waterLevel~0)| ~waterLevel~0))) (and (or (not .cse0) (and (= ~pumpRunning~0 0) .cse1)) (let ((.cse2 (= 1 ~systemActive~0)) (.cse4 (<= |old(~waterLevel~0)| 2))) (or (and .cse2 .cse3 .cse4) (and .cse2 .cse0 .cse4))) (or (not .cse3) (and .cse1 (= ~pumpRunning~0 1))))) Eliminated clause: (exists ((|old(~pumpRunning~0)| Int) (|old(~waterLevel~0)| Int)) (let ((.cse0 (= |old(~pumpRunning~0)| 0)) (.cse3 (= |old(~pumpRunning~0)| 1)) (.cse1 (= |old(~waterLevel~0)| ~waterLevel~0))) (and (or (not .cse0) (and (= ~pumpRunning~0 0) .cse1)) (let ((.cse2 (= 1 ~systemActive~0)) (.cse4 (<= |old(~waterLevel~0)| 2))) (or (and .cse2 .cse3 .cse4) (and .cse2 .cse0 .cse4))) (or (not .cse3) (and .cse1 (= ~pumpRunning~0 1)))))) [2024-10-12 19:41:27,258 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-12 19:41:27,271 WARN L155 FloydHoareUtils]: Requires clause for processEnvironment__wrappee__highWaterSensor contained old-variable. Original clause: (let ((.cse2 (= |old(~pumpRunning~0)| 0)) (.cse1 (= |old(~pumpRunning~0)| 1))) (and (let ((.cse0 (= 1 ~systemActive~0))) (or (and (<= ~waterLevel~0 1) .cse0 .cse1) (and .cse0 .cse2 (<= ~waterLevel~0 2)))) (or (not .cse2) (= ~pumpRunning~0 0)) (or (not .cse1) (= ~pumpRunning~0 1)))) Eliminated clause: (exists ((|old(~pumpRunning~0)| Int)) (let ((.cse2 (= |old(~pumpRunning~0)| 0)) (.cse1 (= |old(~pumpRunning~0)| 1))) (and (let ((.cse0 (= 1 ~systemActive~0))) (or (and (<= ~waterLevel~0 1) .cse0 .cse1) (and .cse0 .cse2 (<= ~waterLevel~0 2)))) (or (not .cse2) (= ~pumpRunning~0 0)) (or (not .cse1) (= ~pumpRunning~0 1))))) [2024-10-12 19:41:27,277 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-12 19:41:27,281 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 .cse0 (<= |old(~waterLevel~0)| 2) (= ~pumpRunning~0 1)) (and (= ~pumpRunning~0 0) .cse0 (<= |old(~waterLevel~0)| 1))))) Eliminated clause: (let ((.cse0 (= 1 ~systemActive~0))) (or (and .cse0 (<= ~waterLevel~0 2) (= ~pumpRunning~0 1)) (and (= ~pumpRunning~0 0) (<= ~waterLevel~0 1) .cse0))) [2024-10-12 19:41:27,293 WARN L155 FloydHoareUtils]: Requires clause for processEnvironment__wrappee__lowWaterSensor contained old-variable. Original clause: (let ((.cse2 (= |old(~pumpRunning~0)| 0)) (.cse1 (= |old(~pumpRunning~0)| 1))) (and (let ((.cse0 (= 1 ~systemActive~0))) (or (and (<= ~waterLevel~0 1) .cse0 .cse1) (and .cse0 .cse2 (<= ~waterLevel~0 2)))) (or (not .cse2) (= ~pumpRunning~0 0)) (or (not .cse1) (= ~pumpRunning~0 1)))) Eliminated clause: (exists ((|old(~pumpRunning~0)| Int)) (let ((.cse2 (= |old(~pumpRunning~0)| 0)) (.cse1 (= |old(~pumpRunning~0)| 1))) (and (let ((.cse0 (= 1 ~systemActive~0))) (or (and (<= ~waterLevel~0 1) .cse0 .cse1) (and .cse0 .cse2 (<= ~waterLevel~0 2)))) (or (not .cse2) (= ~pumpRunning~0 0)) (or (not .cse1) (= ~pumpRunning~0 1))))) [2024-10-12 19:41:27,299 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-12 19:41:27,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 07:41:27 BoogieIcfgContainer [2024-10-12 19:41:27,300 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 19:41:27,301 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 19:41:27,301 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 19:41:27,301 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 19:41:27,302 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:41:19" (3/4) ... [2024-10-12 19:41:27,304 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-12 19:41:27,307 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure deactivatePump [2024-10-12 19:41:27,307 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base [2024-10-12 19:41:27,307 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2024-10-12 19:41:27,308 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure timeShift [2024-10-12 19:41:27,308 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure cleanup [2024-10-12 19:41:27,308 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure isMethaneLevelCritical [2024-10-12 19:41:27,308 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__highWaterSensor [2024-10-12 19:41:27,308 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure waterRise [2024-10-12 19:41:27,308 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__lowWaterSensor [2024-10-12 19:41:27,316 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 36 nodes and edges [2024-10-12 19:41:27,317 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2024-10-12 19:41:27,317 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-12 19:41:27,317 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-12 19:41:27,318 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-12 19:41:27,416 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 19:41:27,416 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-12 19:41:27,417 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 19:41:27,417 INFO L158 Benchmark]: Toolchain (without parser) took 8948.91ms. Allocated memory was 192.9MB in the beginning and 251.7MB in the end (delta: 58.7MB). Free memory was 143.0MB in the beginning and 175.5MB in the end (delta: -32.5MB). Peak memory consumption was 28.0MB. Max. memory is 16.1GB. [2024-10-12 19:41:27,417 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 192.9MB. Free memory is still 161.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 19:41:27,418 INFO L158 Benchmark]: CACSL2BoogieTranslator took 492.81ms. Allocated memory is still 192.9MB. Free memory was 142.6MB in the beginning and 120.6MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-12 19:41:27,418 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.42ms. Allocated memory is still 192.9MB. Free memory was 120.6MB in the beginning and 118.2MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-12 19:41:27,418 INFO L158 Benchmark]: Boogie Preprocessor took 46.41ms. Allocated memory is still 192.9MB. Free memory was 118.2MB in the beginning and 115.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 19:41:27,418 INFO L158 Benchmark]: RCFGBuilder took 516.80ms. Allocated memory is still 192.9MB. Free memory was 115.7MB in the beginning and 90.6MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-12 19:41:27,419 INFO L158 Benchmark]: TraceAbstraction took 7722.30ms. Allocated memory was 192.9MB in the beginning and 251.7MB in the end (delta: 58.7MB). Free memory was 89.9MB in the beginning and 182.8MB in the end (delta: -92.9MB). Peak memory consumption was 84.3MB. Max. memory is 16.1GB. [2024-10-12 19:41:27,419 INFO L158 Benchmark]: Witness Printer took 115.63ms. Allocated memory is still 251.7MB. Free memory was 182.8MB in the beginning and 175.5MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-12 19:41:27,420 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.17ms. Allocated memory is still 192.9MB. Free memory is still 161.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 492.81ms. Allocated memory is still 192.9MB. Free memory was 142.6MB in the beginning and 120.6MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.42ms. Allocated memory is still 192.9MB. Free memory was 120.6MB in the beginning and 118.2MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.41ms. Allocated memory is still 192.9MB. Free memory was 118.2MB in the beginning and 115.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 516.80ms. Allocated memory is still 192.9MB. Free memory was 115.7MB in the beginning and 90.6MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 7722.30ms. Allocated memory was 192.9MB in the beginning and 251.7MB in the end (delta: 58.7MB). Free memory was 89.9MB in the beginning and 182.8MB in the end (delta: -92.9MB). Peak memory consumption was 84.3MB. Max. memory is 16.1GB. * Witness Printer took 115.63ms. Allocated memory is still 251.7MB. Free memory was 182.8MB in the beginning and 175.5MB 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,"Environment.i","") [49] - GenericResultAtLocation [Line: 160]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [160] - GenericResultAtLocation [Line: 262]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [262] - GenericResultAtLocation [Line: 271]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [271] - GenericResultAtLocation [Line: 306]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [306] - GenericResultAtLocation [Line: 341]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [341] - GenericResultAtLocation [Line: 707]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [707] - GenericResultAtLocation [Line: 775]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [775] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - 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: 267]: 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 10 procedures, 81 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.4s, OverallIterations: 12, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1641 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1600 mSDsluCounter, 2066 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1257 mSDsCounter, 523 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2012 IncrementalHoareTripleChecker+Invalid, 2535 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 523 mSolverCounterUnsat, 809 mSDtfsCounter, 2012 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 335 GetRequests, 251 SyntacticMatches, 7 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=279occurred in iteration=9, InterpolantAutomatonStates: 81, 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, 32 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 518 NumberOfCodeBlocks, 518 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 576 ConstructedInterpolants, 0 QuantifiedInterpolants, 1134 SizeOfPredicates, 2 NumberOfNonLiveVariables, 265 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 14 InterpolantComputations, 11 PerfectInterpolantSequences, 43/68 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: 173]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 718]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 719]: Loop Invariant Derived loop invariant: ((((((2 == waterLevel) && (1 == systemActive)) && (splverifierCounter == 0)) && (pumpRunning == 1)) || ((((pumpRunning == 0) && (waterLevel <= 1)) && (1 == systemActive)) && (splverifierCounter == 0))) || ((((waterLevel <= 1) && (1 == systemActive)) && (splverifierCounter == 0)) && (pumpRunning == 1))) - ProcedureContractResult [Line: 898]: Procedure Contract for deactivatePump Derived contract for procedure deactivatePump. Requires: (((waterLevel <= 1) && (1 == systemActive)) && (pumpRunning == 1)) Ensures: ((((pumpRunning == 0) && (waterLevel <= 1)) && (1 == systemActive)) && (\old(pumpRunning) == 1)) - ProcedureContractResult [Line: 805]: Procedure Contract for processEnvironment__wrappee__base Derived contract for procedure processEnvironment__wrappee__base. Requires: ((((pumpRunning == 0) && (waterLevel <= 1)) && (1 == systemActive)) || (((waterLevel <= 1) && (1 == systemActive)) && (pumpRunning == 1))) Ensures: ((((pumpRunning == 0) && (waterLevel <= 1)) && (1 == systemActive)) || (((waterLevel <= 1) && (1 == systemActive)) && (pumpRunning == 1))) - ProcedureContractResult [Line: 84]: Procedure Contract for changeMethaneLevel Derived contract for procedure changeMethaneLevel. Requires: ((((1 == systemActive) && (waterLevel <= 2)) && (pumpRunning == 1)) || (((pumpRunning == 0) && (1 == systemActive)) && (waterLevel <= 2))) Ensures: ((((1 == systemActive) && (waterLevel <= 2)) && (pumpRunning == 1)) || (((pumpRunning == 0) && (1 == systemActive)) && (waterLevel <= 2))) - ProcedureContractResult [Line: 781]: Procedure Contract for timeShift Derived contract for procedure timeShift. Ensures: (((((((waterLevel <= 1) && (waterLevel <= \old(waterLevel))) && (pumpRunning == 1)) || (\old(pumpRunning) != 1)) || (((pumpRunning == 0) && (waterLevel <= 1)) && (waterLevel <= \old(waterLevel)))) && (((((pumpRunning == 0) && (waterLevel <= 1)) && (\old(waterLevel) == waterLevel)) || (\old(pumpRunning) != 0)) || (((2 == waterLevel) && (\old(waterLevel) == 2)) && (pumpRunning == 1)))) && (((1 == systemActive) && (\old(pumpRunning) == 0)) || (((1 == systemActive) && (\old(pumpRunning) == 1)) && (\old(waterLevel) <= 2)))) - ProcedureContractResult [Line: 163]: Procedure Contract for cleanup Derived contract for procedure cleanup. Requires: 0 Ensures: 0 - ProcedureContractResult [Line: 96]: Procedure Contract for isMethaneLevelCritical Derived contract for procedure isMethaneLevelCritical. Requires: ((((1 == systemActive) && (waterLevel <= 2)) && (pumpRunning == 1)) || (((pumpRunning == 0) && (waterLevel <= 1)) && (1 == systemActive))) Ensures: ((((1 == systemActive) && (waterLevel <= 2)) && (pumpRunning == 1)) || (((pumpRunning == 0) && (waterLevel <= 1)) && (1 == systemActive))) - ProcedureContractResult [Line: 813]: Procedure Contract for processEnvironment__wrappee__highWaterSensor Derived contract for procedure processEnvironment__wrappee__highWaterSensor. Ensures: (((((((waterLevel <= 1) && (1 == systemActive)) && (\old(pumpRunning) == 1)) || ((1 == systemActive) && (\old(pumpRunning) == 0))) && (((\old(pumpRunning) != 0) || (pumpRunning == 0)) || (((2 == waterLevel) && (1 == systemActive)) && (pumpRunning == 1)))) && ((\old(pumpRunning) != 1) || (pumpRunning == 1))) && ((((2 == waterLevel) && (1 == systemActive)) && (pumpRunning == 1)) || (waterLevel < 2))) - ProcedureContractResult [Line: 72]: Procedure Contract for waterRise Derived contract for procedure waterRise. Requires: ((((1 == systemActive) && (waterLevel <= 2)) && (pumpRunning == 1)) || (((pumpRunning == 0) && (waterLevel <= 1)) && (1 == systemActive))) Ensures: ((((((pumpRunning != 0) || (2 == waterLevel)) || (\old(waterLevel) != 1)) && ((\old(waterLevel) < 2) || (\old(waterLevel) == waterLevel))) && (waterLevel <= ((long long) \old(waterLevel) + 1))) && ((((1 == systemActive) && (\old(waterLevel) <= 2)) && (pumpRunning == 1)) || (((pumpRunning == 0) && (1 == systemActive)) && (\old(waterLevel) <= 1)))) - ProcedureContractResult [Line: 839]: Procedure Contract for processEnvironment__wrappee__lowWaterSensor Derived contract for procedure processEnvironment__wrappee__lowWaterSensor. Ensures: (((((((waterLevel <= 1) && (1 == systemActive)) && (\old(pumpRunning) == 1)) || ((1 == systemActive) && (\old(pumpRunning) == 0))) && (((\old(pumpRunning) != 0) || (pumpRunning == 0)) || (((2 == waterLevel) && (1 == systemActive)) && (pumpRunning == 1)))) && ((((2 == waterLevel) && (1 == systemActive)) && (pumpRunning == 1)) || (waterLevel < 2))) && ((pumpRunning == 0) || (pumpRunning == 1))) RESULT: Ultimate proved your program to be correct! [2024-10-12 19:41:27,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE