./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.01.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.01.cil-2.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a9e3e69a5dbf08552344fb04914d5344cad021a75381897bc63f6a66dc97b333 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 04:21:27,791 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 04:21:27,852 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 04:21:27,857 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 04:21:27,858 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 04:21:27,892 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 04:21:27,893 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 04:21:27,893 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 04:21:27,894 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 04:21:27,894 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 04:21:27,895 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 04:21:27,895 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 04:21:27,896 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 04:21:27,896 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 04:21:27,896 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 04:21:27,897 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 04:21:27,897 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 04:21:27,897 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 04:21:27,898 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 04:21:27,898 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 04:21:27,898 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 04:21:27,902 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 04:21:27,902 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 04:21:27,903 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 04:21:27,903 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 04:21:27,903 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 04:21:27,903 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 04:21:27,903 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 04:21:27,904 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 04:21:27,904 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 04:21:27,904 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 04:21:27,904 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 04:21:27,905 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:21:27,905 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 04:21:27,906 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 04:21:27,906 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 04:21:27,907 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 04:21:27,907 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 04:21:27,907 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 04:21:27,908 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 04:21:27,908 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 04:21:27,909 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 04:21:27,909 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a9e3e69a5dbf08552344fb04914d5344cad021a75381897bc63f6a66dc97b333 [2024-10-11 04:21:28,208 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 04:21:28,236 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 04:21:28,240 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 04:21:28,241 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 04:21:28,242 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 04:21:28,243 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.01.cil-2.c [2024-10-11 04:21:29,775 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 04:21:30,438 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 04:21:30,439 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.01.cil-2.c [2024-10-11 04:21:30,512 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1c59fd0d2/9f3ee85a7cb44bf5af644f638cb9269e/FLAG61cffb399 [2024-10-11 04:21:30,530 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1c59fd0d2/9f3ee85a7cb44bf5af644f638cb9269e [2024-10-11 04:21:30,533 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 04:21:30,534 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 04:21:30,536 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 04:21:30,536 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 04:21:30,542 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 04:21:30,543 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:21:30" (1/1) ... [2024-10-11 04:21:30,544 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d9eb755 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:21:30, skipping insertion in model container [2024-10-11 04:21:30,544 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:21:30" (1/1) ... [2024-10-11 04:21:30,712 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 04:21:32,517 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/combinations/Problem05_label46+token_ring.01.cil-2.c[382357,382370] [2024-10-11 04:21:32,544 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/combinations/Problem05_label46+token_ring.01.cil-2.c[383339,383352] [2024-10-11 04:21:32,677 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:21:32,689 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 04:21:33,530 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/combinations/Problem05_label46+token_ring.01.cil-2.c[382357,382370] [2024-10-11 04:21:33,534 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/combinations/Problem05_label46+token_ring.01.cil-2.c[383339,383352] [2024-10-11 04:21:33,544 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:21:33,609 INFO L204 MainTranslator]: Completed translation [2024-10-11 04:21:33,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:21:33 WrapperNode [2024-10-11 04:21:33,610 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 04:21:33,611 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 04:21:33,611 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 04:21:33,611 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 04:21:33,618 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:21:33" (1/1) ... [2024-10-11 04:21:33,700 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:21:33" (1/1) ... [2024-10-11 04:21:34,073 INFO L138 Inliner]: procedures = 46, calls = 45, calls flagged for inlining = 23, calls inlined = 23, statements flattened = 12579 [2024-10-11 04:21:34,074 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 04:21:34,075 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 04:21:34,075 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 04:21:34,076 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 04:21:34,086 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:21:33" (1/1) ... [2024-10-11 04:21:34,086 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:21:33" (1/1) ... [2024-10-11 04:21:34,249 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:21:33" (1/1) ... [2024-10-11 04:21:34,372 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 04:21:34,376 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:21:33" (1/1) ... [2024-10-11 04:21:34,377 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:21:33" (1/1) ... [2024-10-11 04:21:34,653 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:21:33" (1/1) ... [2024-10-11 04:21:34,782 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:21:33" (1/1) ... [2024-10-11 04:21:34,808 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:21:33" (1/1) ... [2024-10-11 04:21:34,830 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:21:33" (1/1) ... [2024-10-11 04:21:34,901 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 04:21:34,902 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 04:21:34,903 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 04:21:34,903 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 04:21:34,905 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:21:33" (1/1) ... [2024-10-11 04:21:34,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:21:34,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:21:34,943 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 04:21:34,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 04:21:34,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 04:21:34,995 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-10-11 04:21:34,995 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-10-11 04:21:34,995 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-11 04:21:34,996 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-11 04:21:34,997 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-11 04:21:34,997 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-11 04:21:34,997 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-11 04:21:34,997 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-11 04:21:34,997 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-11 04:21:34,997 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-11 04:21:34,997 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-11 04:21:34,998 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-11 04:21:34,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 04:21:34,998 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-11 04:21:34,998 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-11 04:21:34,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 04:21:34,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 04:21:35,114 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 04:21:35,117 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 04:21:43,285 INFO L? ?]: Removed 1693 outVars from TransFormulas that were not future-live. [2024-10-11 04:21:43,286 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 04:21:43,419 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 04:21:43,420 INFO L314 CfgBuilder]: Removed 5 assume(true) statements. [2024-10-11 04:21:43,421 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:21:43 BoogieIcfgContainer [2024-10-11 04:21:43,422 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 04:21:43,424 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 04:21:43,424 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 04:21:43,428 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 04:21:43,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:21:30" (1/3) ... [2024-10-11 04:21:43,429 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10f2d6fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:21:43, skipping insertion in model container [2024-10-11 04:21:43,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:21:33" (2/3) ... [2024-10-11 04:21:43,429 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10f2d6fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:21:43, skipping insertion in model container [2024-10-11 04:21:43,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:21:43" (3/3) ... [2024-10-11 04:21:43,432 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label46+token_ring.01.cil-2.c [2024-10-11 04:21:43,449 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 04:21:43,450 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 04:21:43,586 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 04:21:43,594 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;@7d7417c6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 04:21:43,595 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 04:21:43,608 INFO L276 IsEmpty]: Start isEmpty. Operand has 2226 states, 2199 states have (on average 1.8872214643019554) internal successors, (4150), 2204 states have internal predecessors, (4150), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 04:21:43,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-11 04:21:43,622 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:21:43,623 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, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:21:43,624 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:21:43,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:21:43,631 INFO L85 PathProgramCache]: Analyzing trace with hash -365934265, now seen corresponding path program 1 times [2024-10-11 04:21:43,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:21:43,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767839211] [2024-10-11 04:21:43,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:21:43,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:21:43,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:44,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:21:44,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:44,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 04:21:44,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:44,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 04:21:44,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:44,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 04:21:44,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:44,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 04:21:44,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:44,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:21:44,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:21:44,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767839211] [2024-10-11 04:21:44,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767839211] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:21:44,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:21:44,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 04:21:44,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886233222] [2024-10-11 04:21:44,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:21:44,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 04:21:44,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:21:44,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 04:21:44,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 04:21:44,199 INFO L87 Difference]: Start difference. First operand has 2226 states, 2199 states have (on average 1.8872214643019554) internal successors, (4150), 2204 states have internal predecessors, (4150), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 4 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-11 04:21:45,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:21:45,041 INFO L93 Difference]: Finished difference Result 4576 states and 8569 transitions. [2024-10-11 04:21:45,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 04:21:45,044 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 4 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 52 [2024-10-11 04:21:45,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:21:45,077 INFO L225 Difference]: With dead ends: 4576 [2024-10-11 04:21:45,077 INFO L226 Difference]: Without dead ends: 2351 [2024-10-11 04:21:45,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:21:45,092 INFO L432 NwaCegarLoop]: 4051 mSDtfsCounter, 4257 mSDsluCounter, 12127 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4265 SdHoareTripleChecker+Valid, 16178 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 04:21:45,096 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4265 Valid, 16178 Invalid, 531 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [72 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 04:21:45,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2351 states. [2024-10-11 04:21:45,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2351 to 2310. [2024-10-11 04:21:45,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2310 states, 2268 states have (on average 1.843915343915344) internal successors, (4182), 2272 states have internal predecessors, (4182), 27 states have call successors, (27), 13 states have call predecessors, (27), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2024-10-11 04:21:45,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2310 states to 2310 states and 4237 transitions. [2024-10-11 04:21:45,267 INFO L78 Accepts]: Start accepts. Automaton has 2310 states and 4237 transitions. Word has length 52 [2024-10-11 04:21:45,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:21:45,268 INFO L471 AbstractCegarLoop]: Abstraction has 2310 states and 4237 transitions. [2024-10-11 04:21:45,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 4 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-11 04:21:45,269 INFO L276 IsEmpty]: Start isEmpty. Operand 2310 states and 4237 transitions. [2024-10-11 04:21:45,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-11 04:21:45,272 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:21:45,272 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, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:21:45,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 04:21:45,273 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:21:45,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:21:45,274 INFO L85 PathProgramCache]: Analyzing trace with hash 101066947, now seen corresponding path program 1 times [2024-10-11 04:21:45,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:21:45,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316684276] [2024-10-11 04:21:45,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:21:45,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:21:45,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:45,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:21:45,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:45,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 04:21:45,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:45,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 04:21:45,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:45,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 04:21:45,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:45,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 04:21:45,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:45,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-11 04:21:45,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:21:45,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316684276] [2024-10-11 04:21:45,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316684276] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:21:45,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:21:45,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:21:45,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989997628] [2024-10-11 04:21:45,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:21:45,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:21:45,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:21:45,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:21:45,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:21:45,490 INFO L87 Difference]: Start difference. First operand 2310 states and 4237 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 4 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-11 04:21:46,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:21:46,447 INFO L93 Difference]: Finished difference Result 2639 states and 4723 transitions. [2024-10-11 04:21:46,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:21:46,448 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 4 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 52 [2024-10-11 04:21:46,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:21:46,464 INFO L225 Difference]: With dead ends: 2639 [2024-10-11 04:21:46,464 INFO L226 Difference]: Without dead ends: 2457 [2024-10-11 04:21:46,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:21:46,468 INFO L432 NwaCegarLoop]: 4113 mSDtfsCounter, 4241 mSDsluCounter, 16292 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4249 SdHoareTripleChecker+Valid, 20405 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 04:21:46,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4249 Valid, 20405 Invalid, 800 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [43 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 04:21:46,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2457 states. [2024-10-11 04:21:46,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2457 to 2394. [2024-10-11 04:21:46,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2394 states, 2335 states have (on average 1.833404710920771) internal successors, (4281), 2340 states have internal predecessors, (4281), 37 states have call successors, (37), 19 states have call predecessors, (37), 20 states have return successors, (40), 36 states have call predecessors, (40), 35 states have call successors, (40) [2024-10-11 04:21:46,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2394 states to 2394 states and 4358 transitions. [2024-10-11 04:21:46,581 INFO L78 Accepts]: Start accepts. Automaton has 2394 states and 4358 transitions. Word has length 52 [2024-10-11 04:21:46,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:21:46,582 INFO L471 AbstractCegarLoop]: Abstraction has 2394 states and 4358 transitions. [2024-10-11 04:21:46,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 4 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-11 04:21:46,584 INFO L276 IsEmpty]: Start isEmpty. Operand 2394 states and 4358 transitions. [2024-10-11 04:21:46,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-11 04:21:46,588 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:21:46,588 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, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:21:46,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 04:21:46,589 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:21:46,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:21:46,590 INFO L85 PathProgramCache]: Analyzing trace with hash 524713669, now seen corresponding path program 1 times [2024-10-11 04:21:46,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:21:46,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135931116] [2024-10-11 04:21:46,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:21:46,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:21:46,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:46,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:21:46,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:46,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 04:21:46,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:46,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 04:21:46,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:46,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 04:21:46,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:46,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 04:21:46,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:46,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:21:46,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:21:46,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135931116] [2024-10-11 04:21:46,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135931116] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:21:46,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:21:46,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:21:46,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765965785] [2024-10-11 04:21:46,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:21:46,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:21:46,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:21:46,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:21:46,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:21:46,812 INFO L87 Difference]: Start difference. First operand 2394 states and 4358 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 4 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-11 04:21:47,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:21:47,723 INFO L93 Difference]: Finished difference Result 2964 states and 5194 transitions. [2024-10-11 04:21:47,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:21:47,724 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 4 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 52 [2024-10-11 04:21:47,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:21:47,740 INFO L225 Difference]: With dead ends: 2964 [2024-10-11 04:21:47,741 INFO L226 Difference]: Without dead ends: 2698 [2024-10-11 04:21:47,744 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:21:47,746 INFO L432 NwaCegarLoop]: 4109 mSDtfsCounter, 4288 mSDsluCounter, 16287 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4298 SdHoareTripleChecker+Valid, 20396 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 04:21:47,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4298 Valid, 20396 Invalid, 791 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [48 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 04:21:47,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2698 states. [2024-10-11 04:21:47,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2698 to 2559. [2024-10-11 04:21:47,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2559 states, 2468 states have (on average 1.8144246353322528) internal successors, (4478), 2475 states have internal predecessors, (4478), 55 states have call successors, (55), 31 states have call predecessors, (55), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2024-10-11 04:21:47,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2559 states to 2559 states and 4599 transitions. [2024-10-11 04:21:47,859 INFO L78 Accepts]: Start accepts. Automaton has 2559 states and 4599 transitions. Word has length 52 [2024-10-11 04:21:47,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:21:47,859 INFO L471 AbstractCegarLoop]: Abstraction has 2559 states and 4599 transitions. [2024-10-11 04:21:47,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 4 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-11 04:21:47,860 INFO L276 IsEmpty]: Start isEmpty. Operand 2559 states and 4599 transitions. [2024-10-11 04:21:47,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-11 04:21:47,866 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:21:47,866 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, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:21:47,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 04:21:47,867 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:21:47,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:21:47,869 INFO L85 PathProgramCache]: Analyzing trace with hash -847093629, now seen corresponding path program 1 times [2024-10-11 04:21:47,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:21:47,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339225685] [2024-10-11 04:21:47,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:21:47,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:21:47,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:47,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:21:47,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:47,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 04:21:47,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:48,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 04:21:48,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:48,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 04:21:48,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:48,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 04:21:48,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:48,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:21:48,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:21:48,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339225685] [2024-10-11 04:21:48,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339225685] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:21:48,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:21:48,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:21:48,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060080935] [2024-10-11 04:21:48,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:21:48,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:21:48,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:21:48,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:21:48,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:21:48,066 INFO L87 Difference]: Start difference. First operand 2559 states and 4599 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 4 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-11 04:21:48,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:21:48,961 INFO L93 Difference]: Finished difference Result 3480 states and 5949 transitions. [2024-10-11 04:21:48,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:21:48,962 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 4 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 52 [2024-10-11 04:21:48,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:21:48,977 INFO L225 Difference]: With dead ends: 3480 [2024-10-11 04:21:48,978 INFO L226 Difference]: Without dead ends: 3049 [2024-10-11 04:21:48,980 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:21:48,981 INFO L432 NwaCegarLoop]: 4098 mSDtfsCounter, 4235 mSDsluCounter, 16272 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4242 SdHoareTripleChecker+Valid, 20370 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 04:21:48,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4242 Valid, 20370 Invalid, 817 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [53 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 04:21:48,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3049 states. [2024-10-11 04:21:49,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3049 to 2840. [2024-10-11 04:21:49,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2840 states, 2691 states have (on average 1.7822370865849126) internal successors, (4796), 2702 states have internal predecessors, (4796), 87 states have call successors, (87), 53 states have call predecessors, (87), 60 states have return successors, (120), 92 states have call predecessors, (120), 85 states have call successors, (120) [2024-10-11 04:21:49,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2840 states to 2840 states and 5003 transitions. [2024-10-11 04:21:49,167 INFO L78 Accepts]: Start accepts. Automaton has 2840 states and 5003 transitions. Word has length 52 [2024-10-11 04:21:49,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:21:49,168 INFO L471 AbstractCegarLoop]: Abstraction has 2840 states and 5003 transitions. [2024-10-11 04:21:49,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 4 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-11 04:21:49,169 INFO L276 IsEmpty]: Start isEmpty. Operand 2840 states and 5003 transitions. [2024-10-11 04:21:49,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-11 04:21:49,173 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:21:49,173 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, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:21:49,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 04:21:49,174 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:21:49,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:21:49,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1602506501, now seen corresponding path program 1 times [2024-10-11 04:21:49,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:21:49,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543451948] [2024-10-11 04:21:49,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:21:49,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:21:49,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:49,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:21:49,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:49,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 04:21:49,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:49,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 04:21:49,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:49,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 04:21:49,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:49,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 04:21:49,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:49,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:21:49,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:21:49,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543451948] [2024-10-11 04:21:49,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543451948] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:21:49,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:21:49,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 04:21:49,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801304785] [2024-10-11 04:21:49,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:21:49,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 04:21:49,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:21:49,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 04:21:49,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 04:21:49,335 INFO L87 Difference]: Start difference. First operand 2840 states and 5003 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 4 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-11 04:21:50,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:21:50,106 INFO L93 Difference]: Finished difference Result 4114 states and 6859 transitions. [2024-10-11 04:21:50,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 04:21:50,107 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 4 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 52 [2024-10-11 04:21:50,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:21:50,125 INFO L225 Difference]: With dead ends: 4114 [2024-10-11 04:21:50,125 INFO L226 Difference]: Without dead ends: 3403 [2024-10-11 04:21:50,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-11 04:21:50,131 INFO L432 NwaCegarLoop]: 4117 mSDtfsCounter, 4346 mSDsluCounter, 12122 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4369 SdHoareTripleChecker+Valid, 16239 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 04:21:50,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4369 Valid, 16239 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 04:21:50,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3403 states. [2024-10-11 04:21:50,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3403 to 3212. [2024-10-11 04:21:50,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3212 states, 2980 states have (on average 1.7426174496644296) internal successors, (5193), 3000 states have internal predecessors, (5193), 136 states have call successors, (136), 83 states have call predecessors, (136), 94 states have return successors, (179), 136 states have call predecessors, (179), 134 states have call successors, (179) [2024-10-11 04:21:50,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3212 states to 3212 states and 5508 transitions. [2024-10-11 04:21:50,253 INFO L78 Accepts]: Start accepts. Automaton has 3212 states and 5508 transitions. Word has length 52 [2024-10-11 04:21:50,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:21:50,253 INFO L471 AbstractCegarLoop]: Abstraction has 3212 states and 5508 transitions. [2024-10-11 04:21:50,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 4 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-11 04:21:50,253 INFO L276 IsEmpty]: Start isEmpty. Operand 3212 states and 5508 transitions. [2024-10-11 04:21:50,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-11 04:21:50,257 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:21:50,257 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:21:50,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 04:21:50,258 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:21:50,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:21:50,258 INFO L85 PathProgramCache]: Analyzing trace with hash -179544944, now seen corresponding path program 1 times [2024-10-11 04:21:50,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:21:50,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584824054] [2024-10-11 04:21:50,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:21:50,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:21:50,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:50,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:21:50,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:50,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 04:21:50,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:50,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 04:21:50,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:50,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 04:21:50,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:50,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 04:21:50,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:50,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 04:21:50,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:50,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:21:50,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:50,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 04:21:50,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:50,385 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 04:21:50,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:21:50,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584824054] [2024-10-11 04:21:50,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584824054] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:21:50,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229800569] [2024-10-11 04:21:50,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:21:50,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:21:50,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:21:50,389 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:21:50,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 04:21:50,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:50,486 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 04:21:50,492 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:21:50,534 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 04:21:50,534 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 04:21:50,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229800569] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:21:50,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 04:21:50,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-11 04:21:50,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246683425] [2024-10-11 04:21:50,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:21:50,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:21:50,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:21:50,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:21:50,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:21:50,537 INFO L87 Difference]: Start difference. First operand 3212 states and 5508 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 04:21:50,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:21:50,709 INFO L93 Difference]: Finished difference Result 5267 states and 8483 transitions. [2024-10-11 04:21:50,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:21:50,710 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 84 [2024-10-11 04:21:50,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:21:50,732 INFO L225 Difference]: With dead ends: 5267 [2024-10-11 04:21:50,732 INFO L226 Difference]: Without dead ends: 4185 [2024-10-11 04:21:50,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:21:50,739 INFO L432 NwaCegarLoop]: 4194 mSDtfsCounter, 107 mSDsluCounter, 4088 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 8282 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:21:50,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 8282 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:21:50,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4185 states. [2024-10-11 04:21:50,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4185 to 4185. [2024-10-11 04:21:50,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4185 states, 3744 states have (on average 1.670405982905983) internal successors, (6254), 3777 states have internal predecessors, (6254), 255 states have call successors, (255), 161 states have call predecessors, (255), 184 states have return successors, (376), 262 states have call predecessors, (376), 253 states have call successors, (376) [2024-10-11 04:21:50,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4185 states to 4185 states and 6885 transitions. [2024-10-11 04:21:50,930 INFO L78 Accepts]: Start accepts. Automaton has 4185 states and 6885 transitions. Word has length 84 [2024-10-11 04:21:50,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:21:50,932 INFO L471 AbstractCegarLoop]: Abstraction has 4185 states and 6885 transitions. [2024-10-11 04:21:50,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 04:21:50,932 INFO L276 IsEmpty]: Start isEmpty. Operand 4185 states and 6885 transitions. [2024-10-11 04:21:50,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-11 04:21:50,941 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:21:50,941 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:21:50,960 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 04:21:51,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:21:51,142 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:21:51,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:21:51,143 INFO L85 PathProgramCache]: Analyzing trace with hash 20714924, now seen corresponding path program 1 times [2024-10-11 04:21:51,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:21:51,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952392755] [2024-10-11 04:21:51,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:21:51,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:21:51,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:51,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:21:51,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:51,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 04:21:51,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:51,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 04:21:51,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:51,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 04:21:51,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:51,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 04:21:51,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:51,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 04:21:51,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:51,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:21:51,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:51,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 04:21:51,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:51,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:21:51,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:51,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 04:21:51,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:51,287 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 04:21:51,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:21:51,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952392755] [2024-10-11 04:21:51,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952392755] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:21:51,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488831514] [2024-10-11 04:21:51,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:21:51,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:21:51,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:21:51,290 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:21:51,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 04:21:51,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:51,383 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 04:21:51,386 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:21:51,504 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 04:21:51,504 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 04:21:51,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488831514] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:21:51,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 04:21:51,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-11 04:21:51,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025679238] [2024-10-11 04:21:51,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:21:51,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:21:51,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:21:51,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:21:51,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:21:51,506 INFO L87 Difference]: Start difference. First operand 4185 states and 6885 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 04:21:51,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:21:51,819 INFO L93 Difference]: Finished difference Result 8169 states and 12572 transitions. [2024-10-11 04:21:51,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:21:51,820 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 107 [2024-10-11 04:21:51,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:21:51,858 INFO L225 Difference]: With dead ends: 8169 [2024-10-11 04:21:51,859 INFO L226 Difference]: Without dead ends: 6117 [2024-10-11 04:21:51,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:21:51,870 INFO L432 NwaCegarLoop]: 4111 mSDtfsCounter, 4036 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4036 SdHoareTripleChecker+Valid, 4229 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:21:51,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4036 Valid, 4229 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:21:51,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6117 states. [2024-10-11 04:21:52,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6117 to 6085. [2024-10-11 04:21:52,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6085 states, 5250 states have (on average 1.5895238095238096) internal successors, (8345), 5312 states have internal predecessors, (8345), 475 states have call successors, (475), 311 states have call predecessors, (475), 358 states have return successors, (688), 477 states have call predecessors, (688), 473 states have call successors, (688) [2024-10-11 04:21:52,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6085 states to 6085 states and 9508 transitions. [2024-10-11 04:21:52,155 INFO L78 Accepts]: Start accepts. Automaton has 6085 states and 9508 transitions. Word has length 107 [2024-10-11 04:21:52,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:21:52,157 INFO L471 AbstractCegarLoop]: Abstraction has 6085 states and 9508 transitions. [2024-10-11 04:21:52,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 04:21:52,158 INFO L276 IsEmpty]: Start isEmpty. Operand 6085 states and 9508 transitions. [2024-10-11 04:21:52,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-11 04:21:52,169 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:21:52,169 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:21:52,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 04:21:52,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:21:52,371 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:21:52,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:21:52,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1514455832, now seen corresponding path program 1 times [2024-10-11 04:21:52,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:21:52,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819032758] [2024-10-11 04:21:52,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:21:52,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:21:52,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:52,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:21:52,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:52,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 04:21:52,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:52,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 04:21:52,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:52,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 04:21:52,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:52,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 04:21:52,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:52,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 04:21:52,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:52,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 04:21:52,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:52,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:21:52,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:52,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 04:21:52,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:52,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:21:52,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:52,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 04:21:52,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:52,516 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-10-11 04:21:52,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:21:52,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819032758] [2024-10-11 04:21:52,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819032758] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:21:52,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188369493] [2024-10-11 04:21:52,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:21:52,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:21:52,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:21:52,519 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:21:52,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 04:21:52,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:52,613 INFO L255 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 04:21:52,616 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:21:52,652 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-11 04:21:52,653 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 04:21:52,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188369493] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:21:52,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 04:21:52,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-11 04:21:52,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309881502] [2024-10-11 04:21:52,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:21:52,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:21:52,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:21:52,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:21:52,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:21:52,655 INFO L87 Difference]: Start difference. First operand 6085 states and 9508 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-11 04:21:52,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:21:52,918 INFO L93 Difference]: Finished difference Result 9149 states and 13829 transitions. [2024-10-11 04:21:52,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:21:52,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 122 [2024-10-11 04:21:52,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:21:52,950 INFO L225 Difference]: With dead ends: 9149 [2024-10-11 04:21:52,950 INFO L226 Difference]: Without dead ends: 6373 [2024-10-11 04:21:52,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:21:52,963 INFO L432 NwaCegarLoop]: 4111 mSDtfsCounter, 4052 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4052 SdHoareTripleChecker+Valid, 4235 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:21:52,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4052 Valid, 4235 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:21:52,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6373 states. [2024-10-11 04:21:53,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6373 to 6335. [2024-10-11 04:21:53,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6335 states, 5468 states have (on average 1.5652889539136796) internal successors, (8559), 5530 states have internal predecessors, (8559), 481 states have call successors, (481), 337 states have call predecessors, (481), 384 states have return successors, (720), 483 states have call predecessors, (720), 479 states have call successors, (720) [2024-10-11 04:21:53,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6335 states to 6335 states and 9760 transitions. [2024-10-11 04:21:53,403 INFO L78 Accepts]: Start accepts. Automaton has 6335 states and 9760 transitions. Word has length 122 [2024-10-11 04:21:53,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:21:53,404 INFO L471 AbstractCegarLoop]: Abstraction has 6335 states and 9760 transitions. [2024-10-11 04:21:53,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-11 04:21:53,404 INFO L276 IsEmpty]: Start isEmpty. Operand 6335 states and 9760 transitions. [2024-10-11 04:21:53,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-11 04:21:53,414 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:21:53,415 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:21:53,432 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 04:21:53,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:21:53,616 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:21:53,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:21:53,617 INFO L85 PathProgramCache]: Analyzing trace with hash -444169551, now seen corresponding path program 1 times [2024-10-11 04:21:53,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:21:53,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348208275] [2024-10-11 04:21:53,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:21:53,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:21:53,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:53,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:21:53,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:53,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 04:21:53,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:53,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 04:21:53,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:53,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 04:21:53,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:53,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 04:21:53,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:53,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 04:21:53,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:53,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:21:53,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:53,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 04:21:53,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:53,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 04:21:53,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:53,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:21:53,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:53,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:21:53,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:53,745 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-10-11 04:21:53,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:21:53,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348208275] [2024-10-11 04:21:53,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348208275] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:21:53,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676565267] [2024-10-11 04:21:53,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:21:53,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:21:53,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:21:53,748 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:21:53,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 04:21:53,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:53,845 INFO L255 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 04:21:53,848 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:21:53,871 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-11 04:21:53,871 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 04:21:53,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1676565267] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:21:53,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 04:21:53,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-11 04:21:53,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274804937] [2024-10-11 04:21:53,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:21:53,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:21:53,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:21:53,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:21:53,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:21:53,874 INFO L87 Difference]: Start difference. First operand 6335 states and 9760 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-11 04:21:54,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:21:54,308 INFO L93 Difference]: Finished difference Result 14423 states and 21066 transitions. [2024-10-11 04:21:54,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:21:54,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 123 [2024-10-11 04:21:54,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:21:54,360 INFO L225 Difference]: With dead ends: 14423 [2024-10-11 04:21:54,360 INFO L226 Difference]: Without dead ends: 10223 [2024-10-11 04:21:54,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:21:54,380 INFO L432 NwaCegarLoop]: 4193 mSDtfsCounter, 120 mSDsluCounter, 4089 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 8282 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:21:54,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 8282 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:21:54,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10223 states. [2024-10-11 04:21:55,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10223 to 10207. [2024-10-11 04:21:55,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10207 states, 8526 states have (on average 1.4828759089842833) internal successors, (12643), 8648 states have internal predecessors, (12643), 927 states have call successors, (927), 657 states have call predecessors, (927), 752 states have return successors, (1550), 933 states have call predecessors, (1550), 925 states have call successors, (1550) [2024-10-11 04:21:55,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10207 states to 10207 states and 15120 transitions. [2024-10-11 04:21:55,201 INFO L78 Accepts]: Start accepts. Automaton has 10207 states and 15120 transitions. Word has length 123 [2024-10-11 04:21:55,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:21:55,202 INFO L471 AbstractCegarLoop]: Abstraction has 10207 states and 15120 transitions. [2024-10-11 04:21:55,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-11 04:21:55,202 INFO L276 IsEmpty]: Start isEmpty. Operand 10207 states and 15120 transitions. [2024-10-11 04:21:55,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-11 04:21:55,224 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:21:55,224 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:21:55,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 04:21:55,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-10-11 04:21:55,425 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:21:55,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:21:55,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1006490321, now seen corresponding path program 1 times [2024-10-11 04:21:55,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:21:55,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836970984] [2024-10-11 04:21:55,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:21:55,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:21:55,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:55,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:21:55,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:55,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 04:21:55,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:55,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 04:21:55,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:55,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 04:21:55,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:55,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 04:21:55,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:55,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 04:21:55,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:55,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 04:21:55,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:55,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:21:55,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:55,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 04:21:55,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:55,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:21:55,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:55,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 04:21:55,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:55,617 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-10-11 04:21:55,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:21:55,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836970984] [2024-10-11 04:21:55,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836970984] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:21:55,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024296135] [2024-10-11 04:21:55,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:21:55,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:21:55,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:21:55,620 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:21:55,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 04:21:55,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:55,719 INFO L255 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 04:21:55,723 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:21:55,766 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 04:21:55,766 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 04:21:55,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2024296135] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:21:55,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 04:21:55,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-11 04:21:55,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082608636] [2024-10-11 04:21:55,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:21:55,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:21:55,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:21:55,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:21:55,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:21:55,769 INFO L87 Difference]: Start difference. First operand 10207 states and 15120 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-11 04:21:56,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:21:56,430 INFO L93 Difference]: Finished difference Result 14381 states and 21212 transitions. [2024-10-11 04:21:56,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:21:56,431 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 124 [2024-10-11 04:21:56,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:21:56,476 INFO L225 Difference]: With dead ends: 14381 [2024-10-11 04:21:56,477 INFO L226 Difference]: Without dead ends: 10227 [2024-10-11 04:21:56,493 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:21:56,494 INFO L432 NwaCegarLoop]: 4160 mSDtfsCounter, 106 mSDsluCounter, 4083 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 8243 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:21:56,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 8243 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:21:56,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10227 states. [2024-10-11 04:21:57,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10227 to 10183. [2024-10-11 04:21:57,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10183 states, 8502 states have (on average 1.4687132439426018) internal successors, (12487), 8624 states have internal predecessors, (12487), 927 states have call successors, (927), 657 states have call predecessors, (927), 752 states have return successors, (1550), 933 states have call predecessors, (1550), 925 states have call successors, (1550) [2024-10-11 04:21:57,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10183 states to 10183 states and 14964 transitions. [2024-10-11 04:21:57,148 INFO L78 Accepts]: Start accepts. Automaton has 10183 states and 14964 transitions. Word has length 124 [2024-10-11 04:21:57,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:21:57,149 INFO L471 AbstractCegarLoop]: Abstraction has 10183 states and 14964 transitions. [2024-10-11 04:21:57,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-11 04:21:57,149 INFO L276 IsEmpty]: Start isEmpty. Operand 10183 states and 14964 transitions. [2024-10-11 04:21:57,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-11 04:21:57,168 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:21:57,168 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:21:57,187 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 04:21:57,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 04:21:57,369 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:21:57,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:21:57,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1898602929, now seen corresponding path program 1 times [2024-10-11 04:21:57,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:21:57,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772945245] [2024-10-11 04:21:57,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:21:57,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:21:57,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:57,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:21:57,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:57,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 04:21:57,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:57,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 04:21:57,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:57,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 04:21:57,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:57,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 04:21:57,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:57,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 04:21:57,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:57,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 04:21:57,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:57,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:21:57,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:57,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 04:21:57,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:57,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:21:57,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:57,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 04:21:57,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:57,494 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-10-11 04:21:57,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:21:57,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772945245] [2024-10-11 04:21:57,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772945245] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:21:57,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435633801] [2024-10-11 04:21:57,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:21:57,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:21:57,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:21:57,497 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:21:57,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 04:21:57,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:57,597 INFO L255 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 04:21:57,599 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:21:57,628 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-11 04:21:57,628 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 04:21:57,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435633801] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:21:57,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 04:21:57,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-11 04:21:57,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050783726] [2024-10-11 04:21:57,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:21:57,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:21:57,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:21:57,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:21:57,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:21:57,631 INFO L87 Difference]: Start difference. First operand 10183 states and 14964 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-11 04:21:58,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:21:58,042 INFO L93 Difference]: Finished difference Result 16127 states and 23370 transitions. [2024-10-11 04:21:58,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:21:58,042 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 124 [2024-10-11 04:21:58,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:21:58,080 INFO L225 Difference]: With dead ends: 16127 [2024-10-11 04:21:58,080 INFO L226 Difference]: Without dead ends: 9051 [2024-10-11 04:21:58,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:21:58,102 INFO L432 NwaCegarLoop]: 4092 mSDtfsCounter, 4081 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4081 SdHoareTripleChecker+Valid, 4112 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:21:58,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4081 Valid, 4112 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:21:58,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9051 states. [2024-10-11 04:21:58,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9051 to 8643. [2024-10-11 04:21:58,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8643 states, 7288 states have (on average 1.4523874862788144) internal successors, (10585), 7378 states have internal predecessors, (10585), 755 states have call successors, (755), 535 states have call predecessors, (755), 598 states have return successors, (1098), 745 states have call predecessors, (1098), 753 states have call successors, (1098) [2024-10-11 04:21:58,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8643 states to 8643 states and 12438 transitions. [2024-10-11 04:21:58,685 INFO L78 Accepts]: Start accepts. Automaton has 8643 states and 12438 transitions. Word has length 124 [2024-10-11 04:21:58,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:21:58,686 INFO L471 AbstractCegarLoop]: Abstraction has 8643 states and 12438 transitions. [2024-10-11 04:21:58,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-11 04:21:58,686 INFO L276 IsEmpty]: Start isEmpty. Operand 8643 states and 12438 transitions. [2024-10-11 04:21:58,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-11 04:21:58,700 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:21:58,700 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:21:58,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-11 04:21:58,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-11 04:21:58,902 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:21:58,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:21:58,903 INFO L85 PathProgramCache]: Analyzing trace with hash -315841116, now seen corresponding path program 1 times [2024-10-11 04:21:58,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:21:58,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373223401] [2024-10-11 04:21:58,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:21:58,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:21:58,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:58,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:21:58,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:58,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 04:21:58,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:58,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 04:21:58,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:58,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 04:21:58,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:58,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 04:21:58,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:58,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 04:21:58,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:58,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 04:21:58,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:58,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:21:58,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:59,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 04:21:59,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:59,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:21:59,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:59,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 04:21:59,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:59,012 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-10-11 04:21:59,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:21:59,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373223401] [2024-10-11 04:21:59,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373223401] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:21:59,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898461198] [2024-10-11 04:21:59,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:21:59,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:21:59,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:21:59,017 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:21:59,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 04:21:59,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:21:59,109 INFO L255 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 04:21:59,111 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:21:59,200 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-11 04:21:59,201 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 04:21:59,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1898461198] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:21:59,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 04:21:59,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-10-11 04:21:59,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087784744] [2024-10-11 04:21:59,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:21:59,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:21:59,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:21:59,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:21:59,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 04:21:59,203 INFO L87 Difference]: Start difference. First operand 8643 states and 12438 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 04:21:59,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:21:59,628 INFO L93 Difference]: Finished difference Result 11183 states and 15869 transitions. [2024-10-11 04:21:59,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 04:21:59,628 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 125 [2024-10-11 04:21:59,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:21:59,658 INFO L225 Difference]: With dead ends: 11183 [2024-10-11 04:21:59,658 INFO L226 Difference]: Without dead ends: 6959 [2024-10-11 04:21:59,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-11 04:21:59,674 INFO L432 NwaCegarLoop]: 4044 mSDtfsCounter, 4099 mSDsluCounter, 8044 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4107 SdHoareTripleChecker+Valid, 12088 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:21:59,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4107 Valid, 12088 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:21:59,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6959 states. [2024-10-11 04:21:59,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6959 to 6935. [2024-10-11 04:21:59,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6935 states, 5938 states have (on average 1.469013135735938) internal successors, (8723), 5992 states have internal predecessors, (8723), 567 states have call successors, (567), 397 states have call predecessors, (567), 428 states have return successors, (766), 553 states have call predecessors, (766), 565 states have call successors, (766) [2024-10-11 04:21:59,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6935 states to 6935 states and 10056 transitions. [2024-10-11 04:22:00,008 INFO L78 Accepts]: Start accepts. Automaton has 6935 states and 10056 transitions. Word has length 125 [2024-10-11 04:22:00,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:22:00,009 INFO L471 AbstractCegarLoop]: Abstraction has 6935 states and 10056 transitions. [2024-10-11 04:22:00,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 04:22:00,009 INFO L276 IsEmpty]: Start isEmpty. Operand 6935 states and 10056 transitions. [2024-10-11 04:22:00,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-11 04:22:00,016 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:22:00,016 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:22:00,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-11 04:22:00,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:22:00,221 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:22:00,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:22:00,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1934816030, now seen corresponding path program 1 times [2024-10-11 04:22:00,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:22:00,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053427] [2024-10-11 04:22:00,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:22:00,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:22:00,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:00,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:22:00,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:00,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 04:22:00,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:00,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 04:22:00,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:00,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 04:22:00,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:00,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 04:22:00,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:00,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 04:22:00,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:00,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 04:22:00,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:00,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:22:00,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:00,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 04:22:00,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:00,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:22:00,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:00,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 04:22:00,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:00,353 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-10-11 04:22:00,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:22:00,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053427] [2024-10-11 04:22:00,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053427] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:22:00,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849007602] [2024-10-11 04:22:00,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:22:00,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:22:00,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:22:00,357 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:22:00,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 04:22:00,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:00,457 INFO L255 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 04:22:00,459 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:22:00,527 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-11 04:22:00,528 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 04:22:00,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849007602] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:22:00,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 04:22:00,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-10-11 04:22:00,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517550301] [2024-10-11 04:22:00,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:22:00,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:22:00,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:22:00,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:22:00,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 04:22:00,531 INFO L87 Difference]: Start difference. First operand 6935 states and 10056 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 04:22:01,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:22:01,017 INFO L93 Difference]: Finished difference Result 10847 states and 15238 transitions. [2024-10-11 04:22:01,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 04:22:01,017 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 125 [2024-10-11 04:22:01,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:22:01,046 INFO L225 Difference]: With dead ends: 10847 [2024-10-11 04:22:01,047 INFO L226 Difference]: Without dead ends: 6579 [2024-10-11 04:22:01,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:22:01,060 INFO L432 NwaCegarLoop]: 4042 mSDtfsCounter, 4129 mSDsluCounter, 8040 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4138 SdHoareTripleChecker+Valid, 12082 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:22:01,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4138 Valid, 12082 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 04:22:01,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6579 states. [2024-10-11 04:22:01,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6579 to 4985. [2024-10-11 04:22:01,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4985 states, 4408 states have (on average 1.5181488203266789) internal successors, (6692), 4438 states have internal predecessors, (6692), 331 states have call successors, (331), 229 states have call predecessors, (331), 244 states have return successors, (439), 321 states have call predecessors, (439), 329 states have call successors, (439) [2024-10-11 04:22:01,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4985 states to 4985 states and 7462 transitions. [2024-10-11 04:22:01,317 INFO L78 Accepts]: Start accepts. Automaton has 4985 states and 7462 transitions. Word has length 125 [2024-10-11 04:22:01,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:22:01,318 INFO L471 AbstractCegarLoop]: Abstraction has 4985 states and 7462 transitions. [2024-10-11 04:22:01,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 04:22:01,318 INFO L276 IsEmpty]: Start isEmpty. Operand 4985 states and 7462 transitions. [2024-10-11 04:22:01,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-11 04:22:01,323 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:22:01,323 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:22:01,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-11 04:22:01,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-11 04:22:01,525 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:22:01,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:22:01,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1476642276, now seen corresponding path program 1 times [2024-10-11 04:22:01,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:22:01,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659629497] [2024-10-11 04:22:01,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:22:01,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:22:01,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:01,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:22:01,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:01,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 04:22:01,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:01,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 04:22:01,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:01,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 04:22:01,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:01,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 04:22:01,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:01,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 04:22:01,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:01,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 04:22:01,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:01,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:22:01,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:01,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 04:22:01,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:01,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:22:01,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:01,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 04:22:01,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:01,644 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-10-11 04:22:01,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:22:01,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659629497] [2024-10-11 04:22:01,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659629497] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:22:01,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731333044] [2024-10-11 04:22:01,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:22:01,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:22:01,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:22:01,648 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:22:01,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 04:22:01,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:01,741 INFO L255 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 04:22:01,743 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:22:01,751 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-10-11 04:22:01,751 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 04:22:01,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1731333044] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:22:01,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 04:22:01,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2024-10-11 04:22:01,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829198651] [2024-10-11 04:22:01,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:22:01,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 04:22:01,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:22:01,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 04:22:01,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 04:22:01,753 INFO L87 Difference]: Start difference. First operand 4985 states and 7462 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 04:22:01,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:22:01,965 INFO L93 Difference]: Finished difference Result 6815 states and 9762 transitions. [2024-10-11 04:22:01,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 04:22:01,966 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 125 [2024-10-11 04:22:01,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:22:01,982 INFO L225 Difference]: With dead ends: 6815 [2024-10-11 04:22:01,982 INFO L226 Difference]: Without dead ends: 3962 [2024-10-11 04:22:01,991 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 04:22:01,992 INFO L432 NwaCegarLoop]: 4084 mSDtfsCounter, 0 mSDsluCounter, 8163 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12247 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:22:01,992 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12247 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:22:01,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3962 states. [2024-10-11 04:22:02,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3962 to 3962. [2024-10-11 04:22:02,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3962 states, 3595 states have (on average 1.5794158553546593) internal successors, (5678), 3613 states have internal predecessors, (5678), 209 states have call successors, (209), 147 states have call predecessors, (209), 156 states have return successors, (250), 203 states have call predecessors, (250), 207 states have call successors, (250) [2024-10-11 04:22:02,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3962 states to 3962 states and 6137 transitions. [2024-10-11 04:22:02,150 INFO L78 Accepts]: Start accepts. Automaton has 3962 states and 6137 transitions. Word has length 125 [2024-10-11 04:22:02,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:22:02,151 INFO L471 AbstractCegarLoop]: Abstraction has 3962 states and 6137 transitions. [2024-10-11 04:22:02,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 04:22:02,151 INFO L276 IsEmpty]: Start isEmpty. Operand 3962 states and 6137 transitions. [2024-10-11 04:22:02,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-11 04:22:02,155 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:22:02,155 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:22:02,172 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-11 04:22:02,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:22:02,356 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:22:02,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:22:02,357 INFO L85 PathProgramCache]: Analyzing trace with hash -985130332, now seen corresponding path program 1 times [2024-10-11 04:22:02,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:22:02,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148315649] [2024-10-11 04:22:02,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:22:02,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:22:02,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:02,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:22:02,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:02,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 04:22:02,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:02,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 04:22:02,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:02,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 04:22:02,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:02,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 04:22:02,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:02,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 04:22:02,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:02,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 04:22:02,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:02,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:22:02,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:02,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 04:22:02,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:02,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:22:02,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:02,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 04:22:02,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:02,462 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-10-11 04:22:02,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:22:02,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148315649] [2024-10-11 04:22:02,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148315649] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:22:02,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562433383] [2024-10-11 04:22:02,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:22:02,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:22:02,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:22:02,466 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:22:02,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-11 04:22:02,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:02,559 INFO L255 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 04:22:02,561 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:22:02,573 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-11 04:22:02,573 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 04:22:02,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [562433383] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:22:02,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 04:22:02,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2024-10-11 04:22:02,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7602126] [2024-10-11 04:22:02,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:22:02,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 04:22:02,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:22:02,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 04:22:02,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 04:22:02,578 INFO L87 Difference]: Start difference. First operand 3962 states and 6137 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 04:22:02,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:22:02,732 INFO L93 Difference]: Finished difference Result 5053 states and 7447 transitions. [2024-10-11 04:22:02,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 04:22:02,732 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 125 [2024-10-11 04:22:02,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:22:02,752 INFO L225 Difference]: With dead ends: 5053 [2024-10-11 04:22:02,753 INFO L226 Difference]: Without dead ends: 2852 [2024-10-11 04:22:02,760 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 04:22:02,760 INFO L432 NwaCegarLoop]: 4083 mSDtfsCounter, 0 mSDsluCounter, 8161 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12244 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:22:02,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12244 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:22:02,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2024-10-11 04:22:02,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 2852. [2024-10-11 04:22:02,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2852 states, 2704 states have (on average 1.7082100591715976) internal successors, (4619), 2713 states have internal predecessors, (4619), 85 states have call successors, (85), 58 states have call predecessors, (85), 61 states have return successors, (87), 81 states have call predecessors, (87), 83 states have call successors, (87) [2024-10-11 04:22:02,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 4791 transitions. [2024-10-11 04:22:02,852 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 4791 transitions. Word has length 125 [2024-10-11 04:22:02,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:22:02,853 INFO L471 AbstractCegarLoop]: Abstraction has 2852 states and 4791 transitions. [2024-10-11 04:22:02,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 04:22:02,853 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 4791 transitions. [2024-10-11 04:22:02,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-11 04:22:02,855 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:22:02,855 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:22:02,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-11 04:22:03,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-11 04:22:03,056 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:22:03,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:22:03,056 INFO L85 PathProgramCache]: Analyzing trace with hash -88102940, now seen corresponding path program 1 times [2024-10-11 04:22:03,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:22:03,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124383979] [2024-10-11 04:22:03,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:22:03,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:22:03,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:03,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:22:03,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:03,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 04:22:03,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:03,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 04:22:03,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:03,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 04:22:03,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:03,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 04:22:03,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:03,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 04:22:03,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:03,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 04:22:03,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:03,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:22:03,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:03,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 04:22:03,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:03,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:22:03,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:03,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 04:22:03,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:03,237 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-10-11 04:22:03,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:22:03,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124383979] [2024-10-11 04:22:03,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124383979] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:22:03,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:22:03,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 04:22:03,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565769319] [2024-10-11 04:22:03,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:22:03,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 04:22:03,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:22:03,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 04:22:03,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 04:22:03,240 INFO L87 Difference]: Start difference. First operand 2852 states and 4791 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2024-10-11 04:22:03,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:22:03,733 INFO L93 Difference]: Finished difference Result 2874 states and 4812 transitions. [2024-10-11 04:22:03,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 04:22:03,734 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 125 [2024-10-11 04:22:03,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:22:03,745 INFO L225 Difference]: With dead ends: 2874 [2024-10-11 04:22:03,746 INFO L226 Difference]: Without dead ends: 2871 [2024-10-11 04:22:03,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-11 04:22:03,748 INFO L432 NwaCegarLoop]: 4084 mSDtfsCounter, 4294 mSDsluCounter, 12093 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4317 SdHoareTripleChecker+Valid, 16177 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 04:22:03,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4317 Valid, 16177 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 04:22:03,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2871 states. [2024-10-11 04:22:03,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2871 to 2851. [2024-10-11 04:22:03,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2851 states, 2704 states have (on average 1.7074704142011834) internal successors, (4617), 2712 states have internal predecessors, (4617), 84 states have call successors, (84), 58 states have call predecessors, (84), 61 states have return successors, (87), 81 states have call predecessors, (87), 83 states have call successors, (87) [2024-10-11 04:22:03,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2851 states to 2851 states and 4788 transitions. [2024-10-11 04:22:03,845 INFO L78 Accepts]: Start accepts. Automaton has 2851 states and 4788 transitions. Word has length 125 [2024-10-11 04:22:03,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:22:03,846 INFO L471 AbstractCegarLoop]: Abstraction has 2851 states and 4788 transitions. [2024-10-11 04:22:03,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2024-10-11 04:22:03,847 INFO L276 IsEmpty]: Start isEmpty. Operand 2851 states and 4788 transitions. [2024-10-11 04:22:03,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-11 04:22:03,848 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:22:03,849 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:22:03,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 04:22:03,849 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:22:03,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:22:03,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1275818764, now seen corresponding path program 1 times [2024-10-11 04:22:03,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:22:03,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226575137] [2024-10-11 04:22:03,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:22:03,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:22:03,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:03,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:22:03,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:03,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 04:22:03,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:03,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 04:22:03,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:03,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 04:22:03,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:03,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 04:22:03,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:03,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 04:22:03,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:03,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 04:22:03,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:03,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:22:03,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:03,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 04:22:03,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:03,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:22:03,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:03,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 04:22:03,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:03,935 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-10-11 04:22:03,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:22:03,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226575137] [2024-10-11 04:22:03,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226575137] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:22:03,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:22:03,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:22:03,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810929993] [2024-10-11 04:22:03,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:22:03,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:22:03,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:22:03,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:22:03,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:22:03,938 INFO L87 Difference]: Start difference. First operand 2851 states and 4788 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 04:22:04,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:22:04,325 INFO L93 Difference]: Finished difference Result 3238 states and 5230 transitions. [2024-10-11 04:22:04,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 04:22:04,326 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 129 [2024-10-11 04:22:04,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:22:04,337 INFO L225 Difference]: With dead ends: 3238 [2024-10-11 04:22:04,337 INFO L226 Difference]: Without dead ends: 2873 [2024-10-11 04:22:04,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 04:22:04,339 INFO L432 NwaCegarLoop]: 4041 mSDtfsCounter, 90 mSDsluCounter, 12024 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 16065 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:22:04,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 16065 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 04:22:04,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2873 states. [2024-10-11 04:22:04,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2873 to 2853. [2024-10-11 04:22:04,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2853 states, 2706 states have (on average 1.7069475240206948) internal successors, (4619), 2714 states have internal predecessors, (4619), 84 states have call successors, (84), 58 states have call predecessors, (84), 61 states have return successors, (87), 81 states have call predecessors, (87), 83 states have call successors, (87) [2024-10-11 04:22:04,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2853 states to 2853 states and 4790 transitions. [2024-10-11 04:22:04,482 INFO L78 Accepts]: Start accepts. Automaton has 2853 states and 4790 transitions. Word has length 129 [2024-10-11 04:22:04,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:22:04,483 INFO L471 AbstractCegarLoop]: Abstraction has 2853 states and 4790 transitions. [2024-10-11 04:22:04,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 04:22:04,483 INFO L276 IsEmpty]: Start isEmpty. Operand 2853 states and 4790 transitions. [2024-10-11 04:22:04,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-11 04:22:04,486 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:22:04,486 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:22:04,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 04:22:04,487 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:22:04,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:22:04,487 INFO L85 PathProgramCache]: Analyzing trace with hash 2124916191, now seen corresponding path program 1 times [2024-10-11 04:22:04,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:22:04,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470108340] [2024-10-11 04:22:04,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:22:04,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:22:04,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 04:22:04,504 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 04:22:04,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 04:22:04,575 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 04:22:04,575 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 04:22:04,576 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-10-11 04:22:04,578 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-11 04:22:04,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 04:22:04,584 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:22:04,708 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 04:22:04,713 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 04:22:04 BoogieIcfgContainer [2024-10-11 04:22:04,713 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 04:22:04,714 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 04:22:04,714 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 04:22:04,714 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 04:22:04,714 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:21:43" (3/4) ... [2024-10-11 04:22:04,715 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-11 04:22:04,846 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 04:22:04,846 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 04:22:04,850 INFO L158 Benchmark]: Toolchain (without parser) took 34312.67ms. Allocated memory was 159.4MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 77.3MB in the beginning and 2.5GB in the end (delta: -2.4GB). Peak memory consumption was 265.9MB. Max. memory is 16.1GB. [2024-10-11 04:22:04,851 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 100.7MB. Free memory is still 66.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 04:22:04,851 INFO L158 Benchmark]: CACSL2BoogieTranslator took 3074.33ms. Allocated memory was 159.4MB in the beginning and 226.5MB in the end (delta: 67.1MB). Free memory was 77.0MB in the beginning and 110.1MB in the end (delta: -33.1MB). Peak memory consumption was 103.2MB. Max. memory is 16.1GB. [2024-10-11 04:22:04,851 INFO L158 Benchmark]: Boogie Procedure Inliner took 463.46ms. Allocated memory is still 226.5MB. Free memory was 110.1MB in the beginning and 74.5MB in the end (delta: 35.6MB). Peak memory consumption was 70.3MB. Max. memory is 16.1GB. [2024-10-11 04:22:04,851 INFO L158 Benchmark]: Boogie Preprocessor took 825.86ms. Allocated memory was 226.5MB in the beginning and 394.3MB in the end (delta: 167.8MB). Free memory was 74.5MB in the beginning and 238.0MB in the end (delta: -163.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-10-11 04:22:04,851 INFO L158 Benchmark]: RCFGBuilder took 8519.26ms. Allocated memory was 394.3MB in the beginning and 788.5MB in the end (delta: 394.3MB). Free memory was 238.0MB in the beginning and 418.4MB in the end (delta: -180.4MB). Peak memory consumption was 454.0MB. Max. memory is 16.1GB. [2024-10-11 04:22:04,852 INFO L158 Benchmark]: TraceAbstraction took 21289.48ms. Allocated memory was 788.5MB in the beginning and 2.8GB in the end (delta: 2.0GB). Free memory was 418.4MB in the beginning and 2.5GB in the end (delta: -2.1GB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 04:22:04,852 INFO L158 Benchmark]: Witness Printer took 132.89ms. Allocated memory is still 2.8GB. Free memory was 2.5GB in the beginning and 2.5GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 04:22:04,853 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 100.7MB. Free memory is still 66.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 3074.33ms. Allocated memory was 159.4MB in the beginning and 226.5MB in the end (delta: 67.1MB). Free memory was 77.0MB in the beginning and 110.1MB in the end (delta: -33.1MB). Peak memory consumption was 103.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 463.46ms. Allocated memory is still 226.5MB. Free memory was 110.1MB in the beginning and 74.5MB in the end (delta: 35.6MB). Peak memory consumption was 70.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 825.86ms. Allocated memory was 226.5MB in the beginning and 394.3MB in the end (delta: 167.8MB). Free memory was 74.5MB in the beginning and 238.0MB in the end (delta: -163.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * RCFGBuilder took 8519.26ms. Allocated memory was 394.3MB in the beginning and 788.5MB in the end (delta: 394.3MB). Free memory was 238.0MB in the beginning and 418.4MB in the end (delta: -180.4MB). Peak memory consumption was 454.0MB. Max. memory is 16.1GB. * TraceAbstraction took 21289.48ms. Allocated memory was 788.5MB in the beginning and 2.8GB in the end (delta: 2.0GB). Free memory was 418.4MB in the beginning and 2.5GB in the end (delta: -2.1GB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 132.89ms. Allocated memory is still 2.8GB. Free memory was 2.5GB in the beginning and 2.5GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * 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 - CounterExampleResult [Line: 11173]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L33] int d= 4; [L34] int c= 3; [L35] int e= 5; [L36] int a= 1; [L37] int f= 6; [L38] int b= 2; [L40] int a9 = 18; [L41] int a27 = 1; [L42] int a2 = 10; [L43] int a16 = 1; [L44] int a15 = 1; [L45] int a12 = 4; [L46] int a25 = 1; [L47] int a20 = 5; [L11177] int m_pc = 0; [L11178] int t1_pc = 0; [L11179] int m_st ; [L11180] int t1_st ; [L11181] int m_i ; [L11182] int t1_i ; [L11183] int M_E = 2; [L11184] int T1_E = 2; [L11185] int E_M = 2; [L11186] int E_1 = 2; [L11190] int token ; [L11192] int local ; [L11651] COND FALSE !(__VERIFIER_nondet_int()) [L11654] CALL main2() [L11638] int __retres1 ; [L11642] CALL init_model() [L11553] m_i = 1 [L11554] t1_i = 1 [L11642] RET init_model() [L11643] CALL start_simulation() [L11579] int kernel_st ; [L11580] int tmp ; [L11581] int tmp___0 ; [L11585] kernel_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11586] FCALL update_channels() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11587] CALL init_threads() [L11335] COND TRUE m_i == 1 [L11336] m_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11340] COND TRUE t1_i == 1 [L11341] t1_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11587] RET init_threads() [L11588] CALL fire_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11424] COND FALSE !(M_E == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11429] COND FALSE !(T1_E == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11434] COND FALSE !(E_M == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11439] COND FALSE !(E_1 == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11588] RET fire_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11589] CALL activate_threads() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11289] COND FALSE !(m_pc == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11299] __retres1 = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11301] return (__retres1); [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND FALSE !(\read(tmp)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11308] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11318] __retres1 = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11320] return (__retres1); [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11589] RET activate_threads() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11590] CALL reset_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11452] COND FALSE !(M_E == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11457] COND FALSE !(T1_E == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11462] COND FALSE !(E_M == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11467] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11590] RET reset_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11593] COND TRUE 1 [L11596] kernel_st = 1 [L11597] CALL eval() [L11371] int tmp ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11375] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11378] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11350] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11366] return (__retres1); [L11378] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11399] COND TRUE t1_st == 0 [L11400] int tmp_ndt_2; [L11401] tmp_ndt_2 = __VERIFIER_nondet_int() [L11402] COND TRUE \read(tmp_ndt_2) [L11404] t1_st = 1 [L11405] CALL transmit1() [L11253] COND TRUE t1_pc == 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1, token=0] [L11264] COND TRUE 1 [L11266] t1_pc = 1 [L11267] t1_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11405] RET transmit1() [L11375] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11378] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11350] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11366] return (__retres1); [L11378] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND TRUE \read(tmp_ndt_1) [L11390] m_st = 1 [L11391] CALL master() [L11195] int tmp_var = __VERIFIER_nondet_int(); [L11197] COND TRUE m_pc == 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L11208] COND TRUE 1 [L11211] token = __VERIFIER_nondet_int() [L11212] local = token [L11213] E_1 = 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L11214] CALL immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11506] CALL activate_threads() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11289] COND FALSE !(m_pc == 1) VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11299] __retres1 = 0 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11301] return (__retres1); [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND FALSE !(\read(tmp)) VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11308] COND TRUE t1_pc == 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11309] COND TRUE E_1 == 1 [L11310] __retres1 = 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11320] return (__retres1); [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND TRUE \read(tmp___0) [L11493] t1_st = 0 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, token=0] [L11506] RET activate_threads() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, token=0] [L11214] RET immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L11215] E_1 = 2 [L11216] m_pc = 1 [L11217] m_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L11391] RET master() [L11399] COND TRUE t1_st == 0 [L11400] int tmp_ndt_2; [L11401] tmp_ndt_2 = __VERIFIER_nondet_int() [L11402] COND TRUE \read(tmp_ndt_2) [L11404] t1_st = 1 [L11405] CALL transmit1() [L11253] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L11256] COND TRUE t1_pc == 1 [L11272] token += 1 [L11273] E_M = 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11274] CALL immediate_notify() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11506] CALL activate_threads() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11289] COND TRUE m_pc == 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11290] COND TRUE E_M == 1 [L11291] __retres1 = 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11301] return (__retres1); [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND TRUE \read(tmp) [L11485] m_st = 0 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11308] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11309] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11318] __retres1 = 0 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11320] return (__retres1); [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11506] RET activate_threads() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11274] RET immediate_notify() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11275] E_M = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11264] COND TRUE 1 [L11266] t1_pc = 1 [L11267] t1_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11405] RET transmit1() [L11375] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11378] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11350] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11366] return (__retres1); [L11378] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND TRUE \read(tmp_ndt_1) [L11390] m_st = 1 [L11391] CALL master() [L11195] int tmp_var = __VERIFIER_nondet_int(); [L11197] COND FALSE !(m_pc == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11200] COND TRUE m_pc == 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11222] COND FALSE !(token != local + 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11227] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11228] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11233] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11234] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11235] COND TRUE tmp_var == 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11236] CALL error() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11173] reach_error() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=1] - UnprovableResult [Line: 11133]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 2226 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 21.1s, OverallIterations: 18, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 9.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 46577 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 46481 mSDsluCounter, 211874 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 142147 mSDsCounter, 427 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4485 IncrementalHoareTripleChecker+Invalid, 4912 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 427 mSolverCounterUnsat, 69727 mSDtfsCounter, 4485 mSolverCounterSat, 0.6s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1633 GetRequests, 1501 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10207occurred in iteration=9, InterpolantAutomatonStates: 116, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.6s AutomataMinimizationTime, 17 MinimizatonAttempts, 2839 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 3012 NumberOfCodeBlocks, 3012 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 2855 ConstructedInterpolants, 0 QuantifiedInterpolants, 4370 SizeOfPredicates, 0 NumberOfNonLiveVariables, 3998 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 27 InterpolantComputations, 17 PerfectInterpolantSequences, 1310/1466 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 RESULT: Ultimate proved your program to be incorrect! [2024-10-11 04:22:04,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE