./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/kundu1.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/kundu1.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c114a15ea6b1c9b012290758a6a9559b9c02a944706c9768958a3bd9c86822a7 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 21:06:51,381 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 21:06:51,447 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 21:06:51,462 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 21:06:51,465 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 21:06:51,492 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 21:06:51,493 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 21:06:51,494 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 21:06:51,494 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 21:06:51,495 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 21:06:51,495 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 21:06:51,496 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 21:06:51,497 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 21:06:51,497 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 21:06:51,497 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 21:06:51,497 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 21:06:51,498 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 21:06:51,498 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 21:06:51,498 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 21:06:51,498 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 21:06:51,498 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 21:06:51,499 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 21:06:51,499 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 21:06:51,499 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 21:06:51,499 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 21:06:51,500 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 21:06:51,500 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 21:06:51,500 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 21:06:51,500 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 21:06:51,501 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 21:06:51,501 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 21:06:51,501 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 21:06:51,501 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:06:51,501 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 21:06:51,502 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 21:06:51,502 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 21:06:51,502 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 21:06:51,502 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 21:06:51,502 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 21:06:51,503 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 21:06:51,503 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 21:06:51,503 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 21:06:51,503 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c114a15ea6b1c9b012290758a6a9559b9c02a944706c9768958a3bd9c86822a7 [2024-11-11 21:06:51,691 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 21:06:51,708 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 21:06:51,711 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 21:06:51,712 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 21:06:51,712 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 21:06:51,713 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/kundu1.cil.c [2024-11-11 21:06:53,016 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 21:06:53,167 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 21:06:53,168 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/kundu1.cil.c [2024-11-11 21:06:53,175 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d55e20239/7270af48eb974e1693336e0aad01ccb4/FLAG0d22208a0 [2024-11-11 21:06:53,582 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d55e20239/7270af48eb974e1693336e0aad01ccb4 [2024-11-11 21:06:53,584 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 21:06:53,585 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 21:06:53,586 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 21:06:53,586 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 21:06:53,589 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 21:06:53,590 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:06:53" (1/1) ... [2024-11-11 21:06:53,591 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5df86dde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:06:53, skipping insertion in model container [2024-11-11 21:06:53,591 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:06:53" (1/1) ... [2024-11-11 21:06:53,616 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 21:06:53,737 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/kundu1.cil.c[636,649] [2024-11-11 21:06:53,773 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:06:53,781 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 21:06:53,790 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/kundu1.cil.c[636,649] [2024-11-11 21:06:53,806 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:06:53,820 INFO L204 MainTranslator]: Completed translation [2024-11-11 21:06:53,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:06:53 WrapperNode [2024-11-11 21:06:53,821 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 21:06:53,822 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 21:06:53,822 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 21:06:53,822 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 21:06:53,827 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:06:53" (1/1) ... [2024-11-11 21:06:53,833 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:06:53" (1/1) ... [2024-11-11 21:06:53,849 INFO L138 Inliner]: procedures = 32, calls = 36, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 258 [2024-11-11 21:06:53,849 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 21:06:53,850 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 21:06:53,850 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 21:06:53,850 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 21:06:53,858 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:06:53" (1/1) ... [2024-11-11 21:06:53,858 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:06:53" (1/1) ... [2024-11-11 21:06:53,859 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:06:53" (1/1) ... [2024-11-11 21:06:53,870 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-11-11 21:06:53,871 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:06:53" (1/1) ... [2024-11-11 21:06:53,871 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:06:53" (1/1) ... [2024-11-11 21:06:53,879 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:06:53" (1/1) ... [2024-11-11 21:06:53,883 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:06:53" (1/1) ... [2024-11-11 21:06:53,884 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:06:53" (1/1) ... [2024-11-11 21:06:53,885 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:06:53" (1/1) ... [2024-11-11 21:06:53,887 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 21:06:53,887 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 21:06:53,888 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 21:06:53,888 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 21:06:53,888 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:06:53" (1/1) ... [2024-11-11 21:06:53,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:06:53,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:06:53,914 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 21:06:53,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 21:06:53,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 21:06:53,953 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-11-11 21:06:53,953 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-11-11 21:06:53,953 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-11 21:06:53,953 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-11 21:06:53,953 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-11 21:06:53,953 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-11 21:06:53,954 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-11 21:06:53,954 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-11 21:06:53,954 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-11 21:06:53,954 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-11 21:06:53,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 21:06:53,954 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-11 21:06:53,954 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-11 21:06:53,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 21:06:53,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 21:06:54,016 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 21:06:54,017 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 21:06:54,246 INFO L? ?]: Removed 47 outVars from TransFormulas that were not future-live. [2024-11-11 21:06:54,246 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 21:06:54,263 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 21:06:54,265 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-11 21:06:54,265 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:06:54 BoogieIcfgContainer [2024-11-11 21:06:54,265 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 21:06:54,267 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 21:06:54,267 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 21:06:54,269 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 21:06:54,269 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 09:06:53" (1/3) ... [2024-11-11 21:06:54,270 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43b8c9db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:06:54, skipping insertion in model container [2024-11-11 21:06:54,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:06:53" (2/3) ... [2024-11-11 21:06:54,270 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43b8c9db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:06:54, skipping insertion in model container [2024-11-11 21:06:54,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:06:54" (3/3) ... [2024-11-11 21:06:54,272 INFO L112 eAbstractionObserver]: Analyzing ICFG kundu1.cil.c [2024-11-11 21:06:54,283 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 21:06:54,283 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 21:06:54,326 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 21:06:54,330 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;@6dc979ce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 21:06:54,331 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 21:06:54,335 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 85 states have (on average 1.4941176470588236) internal successors, (127), 89 states have internal predecessors, (127), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-11 21:06:54,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-11 21:06:54,342 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:06:54,342 INFO L218 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] [2024-11-11 21:06:54,343 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:06:54,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:06:54,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1847694624, now seen corresponding path program 1 times [2024-11-11 21:06:54,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:06:54,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238519255] [2024-11-11 21:06:54,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:06:54,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:06:54,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:06:54,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:06:54,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:06:54,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 21:06:54,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:06:54,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 21:06:54,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:06:54,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-11 21:06:54,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:06:54,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 21:06:54,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:06:54,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:06:54,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:06:54,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238519255] [2024-11-11 21:06:54,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238519255] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:06:54,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:06:54,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:06:54,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801042823] [2024-11-11 21:06:54,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:06:54,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:06:54,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:06:54,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:06:54,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:06:54,736 INFO L87 Difference]: Start difference. First operand has 108 states, 85 states have (on average 1.4941176470588236) internal successors, (127), 89 states have internal predecessors, (127), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 21:06:55,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:06:55,030 INFO L93 Difference]: Finished difference Result 317 states and 469 transitions. [2024-11-11 21:06:55,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 21:06:55,032 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2024-11-11 21:06:55,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:06:55,040 INFO L225 Difference]: With dead ends: 317 [2024-11-11 21:06:55,041 INFO L226 Difference]: Without dead ends: 211 [2024-11-11 21:06:55,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:06:55,047 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 295 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 21:06:55,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 642 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 21:06:55,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-11 21:06:55,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 180. [2024-11-11 21:06:55,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 146 states have (on average 1.404109589041096) internal successors, (205), 149 states have internal predecessors, (205), 23 states have call successors, (23), 11 states have call predecessors, (23), 10 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-11 21:06:55,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 248 transitions. [2024-11-11 21:06:55,095 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 248 transitions. Word has length 51 [2024-11-11 21:06:55,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:06:55,096 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 248 transitions. [2024-11-11 21:06:55,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 21:06:55,096 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 248 transitions. [2024-11-11 21:06:55,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-11 21:06:55,098 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:06:55,098 INFO L218 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] [2024-11-11 21:06:55,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 21:06:55,098 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:06:55,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:06:55,099 INFO L85 PathProgramCache]: Analyzing trace with hash 682456063, now seen corresponding path program 1 times [2024-11-11 21:06:55,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:06:55,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112466853] [2024-11-11 21:06:55,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:06:55,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:06:55,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:06:55,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:06:55,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:06:55,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 21:06:55,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:06:55,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 21:06:55,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:06:55,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-11 21:06:55,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:06:55,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 21:06:55,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:06:55,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:06:55,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:06:55,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112466853] [2024-11-11 21:06:55,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112466853] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:06:55,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:06:55,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 21:06:55,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105138162] [2024-11-11 21:06:55,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:06:55,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 21:06:55,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:06:55,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 21:06:55,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:06:55,281 INFO L87 Difference]: Start difference. First operand 180 states and 248 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 21:06:55,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:06:55,420 INFO L93 Difference]: Finished difference Result 366 states and 511 transitions. [2024-11-11 21:06:55,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 21:06:55,421 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2024-11-11 21:06:55,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:06:55,423 INFO L225 Difference]: With dead ends: 366 [2024-11-11 21:06:55,425 INFO L226 Difference]: Without dead ends: 196 [2024-11-11 21:06:55,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:06:55,428 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 37 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:06:55,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 570 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:06:55,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-11 21:06:55,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 183. [2024-11-11 21:06:55,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 149 states have (on average 1.389261744966443) internal successors, (207), 152 states have internal predecessors, (207), 23 states have call successors, (23), 11 states have call predecessors, (23), 10 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-11 21:06:55,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 250 transitions. [2024-11-11 21:06:55,446 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 250 transitions. Word has length 51 [2024-11-11 21:06:55,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:06:55,446 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 250 transitions. [2024-11-11 21:06:55,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 21:06:55,449 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 250 transitions. [2024-11-11 21:06:55,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-11 21:06:55,450 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:06:55,450 INFO L218 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] [2024-11-11 21:06:55,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 21:06:55,451 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:06:55,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:06:55,451 INFO L85 PathProgramCache]: Analyzing trace with hash 957215677, now seen corresponding path program 1 times [2024-11-11 21:06:55,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:06:55,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877814788] [2024-11-11 21:06:55,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:06:55,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:06:55,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:06:55,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:06:55,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:06:55,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 21:06:55,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:06:55,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 21:06:55,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:06:55,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-11 21:06:55,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:06:55,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 21:06:55,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:06:55,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:06:55,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:06:55,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877814788] [2024-11-11 21:06:55,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877814788] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:06:55,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:06:55,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 21:06:55,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999954819] [2024-11-11 21:06:55,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:06:55,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 21:06:55,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:06:55,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 21:06:55,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:06:55,586 INFO L87 Difference]: Start difference. First operand 183 states and 250 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 21:06:55,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:06:55,964 INFO L93 Difference]: Finished difference Result 719 states and 999 transitions. [2024-11-11 21:06:55,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 21:06:55,965 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2024-11-11 21:06:55,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:06:55,969 INFO L225 Difference]: With dead ends: 719 [2024-11-11 21:06:55,969 INFO L226 Difference]: Without dead ends: 546 [2024-11-11 21:06:55,970 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-11 21:06:55,974 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 557 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 570 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 21:06:55,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [570 Valid, 651 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 21:06:55,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2024-11-11 21:06:56,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 333. [2024-11-11 21:06:56,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 273 states have (on average 1.36996336996337) internal successors, (374), 276 states have internal predecessors, (374), 39 states have call successors, (39), 21 states have call predecessors, (39), 20 states have return successors, (38), 36 states have call predecessors, (38), 36 states have call successors, (38) [2024-11-11 21:06:56,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 451 transitions. [2024-11-11 21:06:56,011 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 451 transitions. Word has length 51 [2024-11-11 21:06:56,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:06:56,011 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 451 transitions. [2024-11-11 21:06:56,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 21:06:56,012 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 451 transitions. [2024-11-11 21:06:56,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-11 21:06:56,013 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:06:56,013 INFO L218 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-11-11 21:06:56,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 21:06:56,013 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:06:56,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:06:56,014 INFO L85 PathProgramCache]: Analyzing trace with hash 758872208, now seen corresponding path program 1 times [2024-11-11 21:06:56,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:06:56,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083921575] [2024-11-11 21:06:56,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:06:56,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:06:56,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:06:56,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:06:56,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:06:56,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 21:06:56,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:06:56,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 21:06:56,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:06:56,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-11 21:06:56,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:06:56,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:06:56,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:06:56,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:06:56,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:06:56,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083921575] [2024-11-11 21:06:56,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083921575] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:06:56,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:06:56,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:06:56,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692754965] [2024-11-11 21:06:56,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:06:56,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:06:56,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:06:56,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:06:56,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:06:56,080 INFO L87 Difference]: Start difference. First operand 333 states and 451 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 21:06:56,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:06:56,344 INFO L93 Difference]: Finished difference Result 1182 states and 1638 transitions. [2024-11-11 21:06:56,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 21:06:56,345 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2024-11-11 21:06:56,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:06:56,351 INFO L225 Difference]: With dead ends: 1182 [2024-11-11 21:06:56,351 INFO L226 Difference]: Without dead ends: 859 [2024-11-11 21:06:56,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:06:56,353 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 293 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 21:06:56,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 714 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 21:06:56,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2024-11-11 21:06:56,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 758. [2024-11-11 21:06:56,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 758 states, 620 states have (on average 1.320967741935484) internal successors, (819), 623 states have internal predecessors, (819), 87 states have call successors, (87), 51 states have call predecessors, (87), 50 states have return successors, (98), 84 states have call predecessors, (98), 84 states have call successors, (98) [2024-11-11 21:06:56,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 1004 transitions. [2024-11-11 21:06:56,420 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 1004 transitions. Word has length 52 [2024-11-11 21:06:56,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:06:56,421 INFO L471 AbstractCegarLoop]: Abstraction has 758 states and 1004 transitions. [2024-11-11 21:06:56,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 21:06:56,421 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 1004 transitions. [2024-11-11 21:06:56,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-11 21:06:56,423 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:06:56,423 INFO L218 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-11-11 21:06:56,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 21:06:56,424 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:06:56,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:06:56,424 INFO L85 PathProgramCache]: Analyzing trace with hash 701727983, now seen corresponding path program 1 times [2024-11-11 21:06:56,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:06:56,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403825808] [2024-11-11 21:06:56,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:06:56,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:06:56,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:06:56,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:06:56,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:06:56,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 21:06:56,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:06:56,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 21:06:56,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:06:56,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-11 21:06:56,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:06:56,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:06:56,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:06:56,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:06:56,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:06:56,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403825808] [2024-11-11 21:06:56,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403825808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:06:56,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:06:56,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 21:06:56,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875156352] [2024-11-11 21:06:56,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:06:56,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 21:06:56,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:06:56,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 21:06:56,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:06:56,500 INFO L87 Difference]: Start difference. First operand 758 states and 1004 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 21:06:56,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:06:56,643 INFO L93 Difference]: Finished difference Result 1567 states and 2124 transitions. [2024-11-11 21:06:56,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 21:06:56,644 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2024-11-11 21:06:56,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:06:56,648 INFO L225 Difference]: With dead ends: 1567 [2024-11-11 21:06:56,649 INFO L226 Difference]: Without dead ends: 819 [2024-11-11 21:06:56,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:06:56,651 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 37 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:06:56,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 557 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:06:56,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2024-11-11 21:06:56,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 776. [2024-11-11 21:06:56,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 638 states have (on average 1.3056426332288402) internal successors, (833), 641 states have internal predecessors, (833), 87 states have call successors, (87), 51 states have call predecessors, (87), 50 states have return successors, (98), 84 states have call predecessors, (98), 84 states have call successors, (98) [2024-11-11 21:06:56,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1018 transitions. [2024-11-11 21:06:56,700 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1018 transitions. Word has length 52 [2024-11-11 21:06:56,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:06:56,701 INFO L471 AbstractCegarLoop]: Abstraction has 776 states and 1018 transitions. [2024-11-11 21:06:56,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 21:06:56,701 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1018 transitions. [2024-11-11 21:06:56,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-11 21:06:56,704 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:06:56,704 INFO L218 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-11-11 21:06:56,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 21:06:56,704 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:06:56,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:06:56,705 INFO L85 PathProgramCache]: Analyzing trace with hash 763767597, now seen corresponding path program 1 times [2024-11-11 21:06:56,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:06:56,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479935860] [2024-11-11 21:06:56,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:06:56,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:06:56,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:06:56,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:06:56,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:06:56,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 21:06:56,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:06:56,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 21:06:56,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:06:56,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-11 21:06:56,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:06:56,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:06:56,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:06:56,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:06:56,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:06:56,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479935860] [2024-11-11 21:06:56,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479935860] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:06:56,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:06:56,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:06:56,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651900431] [2024-11-11 21:06:56,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:06:56,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:06:56,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:06:56,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:06:56,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:06:56,770 INFO L87 Difference]: Start difference. First operand 776 states and 1018 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-11 21:06:56,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:06:56,952 INFO L93 Difference]: Finished difference Result 2090 states and 2769 transitions. [2024-11-11 21:06:56,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 21:06:56,953 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 52 [2024-11-11 21:06:56,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:06:56,957 INFO L225 Difference]: With dead ends: 2090 [2024-11-11 21:06:56,958 INFO L226 Difference]: Without dead ends: 1392 [2024-11-11 21:06:56,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:06:56,960 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 175 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:06:56,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 460 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:06:56,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2024-11-11 21:06:57,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 1302. [2024-11-11 21:06:57,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1302 states, 1073 states have (on average 1.3019571295433365) internal successors, (1397), 1076 states have internal predecessors, (1397), 143 states have call successors, (143), 86 states have call predecessors, (143), 85 states have return successors, (166), 140 states have call predecessors, (166), 140 states have call successors, (166) [2024-11-11 21:06:57,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1302 states to 1302 states and 1706 transitions. [2024-11-11 21:06:57,016 INFO L78 Accepts]: Start accepts. Automaton has 1302 states and 1706 transitions. Word has length 52 [2024-11-11 21:06:57,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:06:57,016 INFO L471 AbstractCegarLoop]: Abstraction has 1302 states and 1706 transitions. [2024-11-11 21:06:57,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-11 21:06:57,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1302 states and 1706 transitions. [2024-11-11 21:06:57,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-11 21:06:57,018 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:06:57,019 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:06:57,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 21:06:57,019 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:06:57,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:06:57,019 INFO L85 PathProgramCache]: Analyzing trace with hash -938478105, now seen corresponding path program 1 times [2024-11-11 21:06:57,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:06:57,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696064429] [2024-11-11 21:06:57,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:06:57,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:06:57,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:06:57,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:06:57,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:06:57,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 21:06:57,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:06:57,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 21:06:57,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:06:57,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-11 21:06:57,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:06:57,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:06:57,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:06:57,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:06:57,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:06:57,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696064429] [2024-11-11 21:06:57,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696064429] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:06:57,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:06:57,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 21:06:57,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389740793] [2024-11-11 21:06:57,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:06:57,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 21:06:57,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:06:57,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 21:06:57,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:06:57,080 INFO L87 Difference]: Start difference. First operand 1302 states and 1706 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-11 21:06:57,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:06:57,296 INFO L93 Difference]: Finished difference Result 2502 states and 3310 transitions. [2024-11-11 21:06:57,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 21:06:57,297 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 60 [2024-11-11 21:06:57,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:06:57,303 INFO L225 Difference]: With dead ends: 2502 [2024-11-11 21:06:57,303 INFO L226 Difference]: Without dead ends: 1573 [2024-11-11 21:06:57,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:06:57,307 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 405 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:06:57,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 581 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:06:57,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1573 states. [2024-11-11 21:06:57,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1573 to 1462. [2024-11-11 21:06:57,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1462 states, 1207 states have (on average 1.2999171499585749) internal successors, (1569), 1210 states have internal predecessors, (1569), 159 states have call successors, (159), 96 states have call predecessors, (159), 95 states have return successors, (184), 156 states have call predecessors, (184), 156 states have call successors, (184) [2024-11-11 21:06:57,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1462 states to 1462 states and 1912 transitions. [2024-11-11 21:06:57,364 INFO L78 Accepts]: Start accepts. Automaton has 1462 states and 1912 transitions. Word has length 60 [2024-11-11 21:06:57,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:06:57,366 INFO L471 AbstractCegarLoop]: Abstraction has 1462 states and 1912 transitions. [2024-11-11 21:06:57,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-11 21:06:57,366 INFO L276 IsEmpty]: Start isEmpty. Operand 1462 states and 1912 transitions. [2024-11-11 21:06:57,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-11 21:06:57,369 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:06:57,369 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:06:57,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 21:06:57,369 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:06:57,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:06:57,370 INFO L85 PathProgramCache]: Analyzing trace with hash 2020590272, now seen corresponding path program 1 times [2024-11-11 21:06:57,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:06:57,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844321591] [2024-11-11 21:06:57,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:06:57,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:06:57,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:06:57,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:06:57,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:06:57,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 21:06:57,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:06:57,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 21:06:57,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:06:57,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-11 21:06:57,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:06:57,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:06:57,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:06:57,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:06:57,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:06:57,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844321591] [2024-11-11 21:06:57,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844321591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:06:57,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:06:57,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:06:57,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147958563] [2024-11-11 21:06:57,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:06:57,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:06:57,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:06:57,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:06:57,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:06:57,461 INFO L87 Difference]: Start difference. First operand 1462 states and 1912 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-11 21:06:57,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:06:57,713 INFO L93 Difference]: Finished difference Result 3634 states and 4793 transitions. [2024-11-11 21:06:57,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 21:06:57,714 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 63 [2024-11-11 21:06:57,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:06:57,722 INFO L225 Difference]: With dead ends: 3634 [2024-11-11 21:06:57,722 INFO L226 Difference]: Without dead ends: 2250 [2024-11-11 21:06:57,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-11 21:06:57,726 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 396 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 21:06:57,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 644 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 21:06:57,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2250 states. [2024-11-11 21:06:57,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2250 to 2074. [2024-11-11 21:06:57,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2074 states, 1715 states have (on average 1.2979591836734694) internal successors, (2226), 1718 states have internal predecessors, (2226), 223 states have call successors, (223), 136 states have call predecessors, (223), 135 states have return successors, (262), 220 states have call predecessors, (262), 220 states have call successors, (262) [2024-11-11 21:06:57,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2074 states to 2074 states and 2711 transitions. [2024-11-11 21:06:57,819 INFO L78 Accepts]: Start accepts. Automaton has 2074 states and 2711 transitions. Word has length 63 [2024-11-11 21:06:57,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:06:57,819 INFO L471 AbstractCegarLoop]: Abstraction has 2074 states and 2711 transitions. [2024-11-11 21:06:57,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-11 21:06:57,819 INFO L276 IsEmpty]: Start isEmpty. Operand 2074 states and 2711 transitions. [2024-11-11 21:06:57,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-11 21:06:57,820 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:06:57,820 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:06:57,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 21:06:57,820 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:06:57,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:06:57,821 INFO L85 PathProgramCache]: Analyzing trace with hash -285621863, now seen corresponding path program 1 times [2024-11-11 21:06:57,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:06:57,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640771076] [2024-11-11 21:06:57,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:06:57,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:06:57,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:06:57,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:06:57,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:06:57,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 21:06:57,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:06:57,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 21:06:57,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:06:57,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-11 21:06:57,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:06:57,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:06:57,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:06:57,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 21:06:57,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:06:57,888 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-11 21:06:57,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:06:57,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640771076] [2024-11-11 21:06:57,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640771076] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:06:57,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943517755] [2024-11-11 21:06:57,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:06:57,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:06:57,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:06:57,890 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:06:57,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 21:06:57,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:06:57,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 21:06:57,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:06:57,984 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:06:57,984 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 21:06:57,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943517755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:06:57,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 21:06:57,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-11 21:06:57,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690301759] [2024-11-11 21:06:57,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:06:57,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:06:57,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:06:57,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:06:57,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:06:57,986 INFO L87 Difference]: Start difference. First operand 2074 states and 2711 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-11 21:06:58,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:06:58,110 INFO L93 Difference]: Finished difference Result 5786 states and 7696 transitions. [2024-11-11 21:06:58,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:06:58,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 68 [2024-11-11 21:06:58,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:06:58,123 INFO L225 Difference]: With dead ends: 5786 [2024-11-11 21:06:58,123 INFO L226 Difference]: Without dead ends: 3723 [2024-11-11 21:06:58,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:06:58,128 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 92 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:06:58,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 360 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:06:58,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3723 states. [2024-11-11 21:06:58,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3723 to 3585. [2024-11-11 21:06:58,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3585 states, 2937 states have (on average 1.275110657133129) internal successors, (3745), 2941 states have internal predecessors, (3745), 402 states have call successors, (402), 246 states have call predecessors, (402), 245 states have return successors, (553), 399 states have call predecessors, (553), 399 states have call successors, (553) [2024-11-11 21:06:58,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3585 states to 3585 states and 4700 transitions. [2024-11-11 21:06:58,276 INFO L78 Accepts]: Start accepts. Automaton has 3585 states and 4700 transitions. Word has length 68 [2024-11-11 21:06:58,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:06:58,277 INFO L471 AbstractCegarLoop]: Abstraction has 3585 states and 4700 transitions. [2024-11-11 21:06:58,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-11 21:06:58,277 INFO L276 IsEmpty]: Start isEmpty. Operand 3585 states and 4700 transitions. [2024-11-11 21:06:58,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-11 21:06:58,279 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:06:58,279 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-11 21:06:58,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-11 21:06:58,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:06:58,480 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:06:58,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:06:58,480 INFO L85 PathProgramCache]: Analyzing trace with hash -914471196, now seen corresponding path program 1 times [2024-11-11 21:06:58,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:06:58,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575713730] [2024-11-11 21:06:58,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:06:58,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:06:58,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:06:58,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:06:58,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:06:58,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 21:06:58,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:06:58,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 21:06:58,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:06:58,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-11 21:06:58,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:06:58,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:06:58,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:06:58,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-11 21:06:58,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:06:58,554 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-11 21:06:58,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:06:58,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575713730] [2024-11-11 21:06:58,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575713730] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:06:58,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:06:58,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:06:58,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955581054] [2024-11-11 21:06:58,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:06:58,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:06:58,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:06:58,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:06:58,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:06:58,559 INFO L87 Difference]: Start difference. First operand 3585 states and 4700 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-11 21:06:58,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:06:58,823 INFO L93 Difference]: Finished difference Result 7440 states and 9799 transitions. [2024-11-11 21:06:58,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 21:06:58,824 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 71 [2024-11-11 21:06:58,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:06:58,843 INFO L225 Difference]: With dead ends: 7440 [2024-11-11 21:06:58,844 INFO L226 Difference]: Without dead ends: 3870 [2024-11-11 21:06:58,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:06:58,853 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 163 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:06:58,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 418 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:06:58,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3870 states. [2024-11-11 21:06:59,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3870 to 3623. [2024-11-11 21:06:59,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3623 states, 2956 states have (on average 1.257104194857916) internal successors, (3716), 2979 states have internal predecessors, (3716), 402 states have call successors, (402), 246 states have call predecessors, (402), 264 states have return successors, (553), 399 states have call predecessors, (553), 399 states have call successors, (553) [2024-11-11 21:06:59,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3623 states to 3623 states and 4671 transitions. [2024-11-11 21:06:59,056 INFO L78 Accepts]: Start accepts. Automaton has 3623 states and 4671 transitions. Word has length 71 [2024-11-11 21:06:59,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:06:59,056 INFO L471 AbstractCegarLoop]: Abstraction has 3623 states and 4671 transitions. [2024-11-11 21:06:59,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-11 21:06:59,057 INFO L276 IsEmpty]: Start isEmpty. Operand 3623 states and 4671 transitions. [2024-11-11 21:06:59,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-11 21:06:59,059 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:06:59,059 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-11 21:06:59,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 21:06:59,060 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:06:59,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:06:59,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1331867802, now seen corresponding path program 1 times [2024-11-11 21:06:59,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:06:59,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10380957] [2024-11-11 21:06:59,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:06:59,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:06:59,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:06:59,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:06:59,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:06:59,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 21:06:59,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:06:59,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 21:06:59,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:06:59,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-11 21:06:59,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:06:59,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:06:59,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:06:59,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-11 21:06:59,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:06:59,119 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-11 21:06:59,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:06:59,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10380957] [2024-11-11 21:06:59,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10380957] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:06:59,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:06:59,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:06:59,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179646308] [2024-11-11 21:06:59,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:06:59,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:06:59,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:06:59,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:06:59,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:06:59,121 INFO L87 Difference]: Start difference. First operand 3623 states and 4671 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 21:06:59,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:06:59,287 INFO L93 Difference]: Finished difference Result 4090 states and 5308 transitions. [2024-11-11 21:06:59,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:06:59,287 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2024-11-11 21:06:59,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:06:59,301 INFO L225 Difference]: With dead ends: 4090 [2024-11-11 21:06:59,301 INFO L226 Difference]: Without dead ends: 3885 [2024-11-11 21:06:59,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:06:59,303 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 174 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:06:59,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 208 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:06:59,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3885 states. [2024-11-11 21:06:59,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3885 to 3554. [2024-11-11 21:06:59,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3554 states, 2903 states have (on average 1.258008956252153) internal successors, (3652), 2925 states have internal predecessors, (3652), 391 states have call successors, (391), 241 states have call predecessors, (391), 259 states have return successors, (542), 388 states have call predecessors, (542), 388 states have call successors, (542) [2024-11-11 21:06:59,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3554 states to 3554 states and 4585 transitions. [2024-11-11 21:06:59,493 INFO L78 Accepts]: Start accepts. Automaton has 3554 states and 4585 transitions. Word has length 71 [2024-11-11 21:06:59,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:06:59,493 INFO L471 AbstractCegarLoop]: Abstraction has 3554 states and 4585 transitions. [2024-11-11 21:06:59,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 21:06:59,494 INFO L276 IsEmpty]: Start isEmpty. Operand 3554 states and 4585 transitions. [2024-11-11 21:06:59,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-11 21:06:59,494 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:06:59,494 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-11 21:06:59,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 21:06:59,495 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:06:59,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:06:59,495 INFO L85 PathProgramCache]: Analyzing trace with hash -2052507104, now seen corresponding path program 1 times [2024-11-11 21:06:59,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:06:59,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038713496] [2024-11-11 21:06:59,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:06:59,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:06:59,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:06:59,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:06:59,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:06:59,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 21:06:59,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:06:59,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 21:06:59,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:06:59,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-11 21:06:59,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:06:59,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:06:59,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:06:59,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-11 21:06:59,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:06:59,541 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 21:06:59,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:06:59,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038713496] [2024-11-11 21:06:59,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038713496] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:06:59,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:06:59,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 21:06:59,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414787414] [2024-11-11 21:06:59,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:06:59,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 21:06:59,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:06:59,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 21:06:59,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:06:59,542 INFO L87 Difference]: Start difference. First operand 3554 states and 4585 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-11 21:07:00,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:07:00,206 INFO L93 Difference]: Finished difference Result 10646 states and 14120 transitions. [2024-11-11 21:07:00,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 21:07:00,206 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 72 [2024-11-11 21:07:00,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:07:00,240 INFO L225 Difference]: With dead ends: 10646 [2024-11-11 21:07:00,240 INFO L226 Difference]: Without dead ends: 6920 [2024-11-11 21:07:00,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-11 21:07:00,259 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 634 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 646 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 21:07:00,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [646 Valid, 754 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 21:07:00,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6920 states. [2024-11-11 21:07:00,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6920 to 6782. [2024-11-11 21:07:00,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6782 states, 5504 states have (on average 1.2185683139534884) internal successors, (6707), 5566 states have internal predecessors, (6707), 754 states have call successors, (754), 466 states have call predecessors, (754), 523 states have return successors, (1151), 751 states have call predecessors, (1151), 751 states have call successors, (1151) [2024-11-11 21:07:00,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6782 states to 6782 states and 8612 transitions. [2024-11-11 21:07:00,590 INFO L78 Accepts]: Start accepts. Automaton has 6782 states and 8612 transitions. Word has length 72 [2024-11-11 21:07:00,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:07:00,592 INFO L471 AbstractCegarLoop]: Abstraction has 6782 states and 8612 transitions. [2024-11-11 21:07:00,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-11 21:07:00,592 INFO L276 IsEmpty]: Start isEmpty. Operand 6782 states and 8612 transitions. [2024-11-11 21:07:00,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-11 21:07:00,623 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:07:00,623 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:07:00,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 21:07:00,624 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:07:00,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:07:00,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1221595769, now seen corresponding path program 1 times [2024-11-11 21:07:00,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:07:00,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243877078] [2024-11-11 21:07:00,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:07:00,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:07:00,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:00,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:07:00,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:00,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 21:07:00,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:00,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 21:07:00,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:00,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-11 21:07:00,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:00,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:07:00,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:00,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-11 21:07:00,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:00,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-11 21:07:00,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:00,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 21:07:00,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:00,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-11 21:07:00,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:00,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-11 21:07:00,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:00,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-11 21:07:00,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:00,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-11 21:07:00,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:00,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-11 21:07:00,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:00,739 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-11-11 21:07:00,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:07:00,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243877078] [2024-11-11 21:07:00,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243877078] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:07:00,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177849661] [2024-11-11 21:07:00,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:07:00,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:07:00,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:07:00,742 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:07:00,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 21:07:00,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:00,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 21:07:00,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:07:00,889 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-11 21:07:00,889 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 21:07:00,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177849661] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:07:00,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 21:07:00,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2024-11-11 21:07:00,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161933492] [2024-11-11 21:07:00,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:07:00,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:07:00,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:07:00,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:07:00,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:07:00,891 INFO L87 Difference]: Start difference. First operand 6782 states and 8612 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-11 21:07:01,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:07:01,091 INFO L93 Difference]: Finished difference Result 11268 states and 14376 transitions. [2024-11-11 21:07:01,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:07:01,092 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 127 [2024-11-11 21:07:01,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:07:01,107 INFO L225 Difference]: With dead ends: 11268 [2024-11-11 21:07:01,107 INFO L226 Difference]: Without dead ends: 4297 [2024-11-11 21:07:01,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:07:01,120 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 76 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:07:01,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 135 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:07:01,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4297 states. [2024-11-11 21:07:01,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4297 to 4293. [2024-11-11 21:07:01,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4293 states, 3485 states have (on average 1.20545193687231) internal successors, (4201), 3521 states have internal predecessors, (4201), 478 states have call successors, (478), 296 states have call predecessors, (478), 329 states have return successors, (694), 476 states have call predecessors, (694), 476 states have call successors, (694) [2024-11-11 21:07:01,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4293 states to 4293 states and 5373 transitions. [2024-11-11 21:07:01,291 INFO L78 Accepts]: Start accepts. Automaton has 4293 states and 5373 transitions. Word has length 127 [2024-11-11 21:07:01,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:07:01,292 INFO L471 AbstractCegarLoop]: Abstraction has 4293 states and 5373 transitions. [2024-11-11 21:07:01,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-11 21:07:01,292 INFO L276 IsEmpty]: Start isEmpty. Operand 4293 states and 5373 transitions. [2024-11-11 21:07:01,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-11 21:07:01,296 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:07:01,296 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:07:01,310 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-11 21:07:01,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-11 21:07:01,501 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:07:01,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:07:01,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1343258013, now seen corresponding path program 1 times [2024-11-11 21:07:01,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:07:01,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649209823] [2024-11-11 21:07:01,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:07:01,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:07:01,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:01,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:07:01,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:01,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 21:07:01,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:01,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 21:07:01,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:01,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-11 21:07:01,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:01,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:07:01,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:01,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-11 21:07:01,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:01,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-11 21:07:01,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:01,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-11 21:07:01,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:01,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-11 21:07:01,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:01,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 21:07:01,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:01,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 21:07:01,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:01,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-11 21:07:01,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:01,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-11 21:07:01,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:01,624 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-11 21:07:01,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:07:01,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649209823] [2024-11-11 21:07:01,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649209823] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:07:01,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905660437] [2024-11-11 21:07:01,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:07:01,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:07:01,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:07:01,626 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:07:01,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-11 21:07:01,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:01,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 21:07:01,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:07:01,796 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 21:07:01,796 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 21:07:01,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [905660437] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:07:01,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 21:07:01,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2024-11-11 21:07:01,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519773283] [2024-11-11 21:07:01,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:07:01,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:07:01,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:07:01,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:07:01,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:07:01,800 INFO L87 Difference]: Start difference. First operand 4293 states and 5373 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-11 21:07:02,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:07:02,105 INFO L93 Difference]: Finished difference Result 9150 states and 11419 transitions. [2024-11-11 21:07:02,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:07:02,106 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 131 [2024-11-11 21:07:02,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:07:02,131 INFO L225 Difference]: With dead ends: 9150 [2024-11-11 21:07:02,131 INFO L226 Difference]: Without dead ends: 5190 [2024-11-11 21:07:02,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:07:02,143 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 45 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:07:02,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 260 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:07:02,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5190 states. [2024-11-11 21:07:02,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5190 to 5190. [2024-11-11 21:07:02,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5190 states, 4198 states have (on average 1.193425440686041) internal successors, (5010), 4238 states have internal predecessors, (5010), 583 states have call successors, (583), 371 states have call predecessors, (583), 408 states have return successors, (809), 581 states have call predecessors, (809), 581 states have call successors, (809) [2024-11-11 21:07:02,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5190 states to 5190 states and 6402 transitions. [2024-11-11 21:07:02,446 INFO L78 Accepts]: Start accepts. Automaton has 5190 states and 6402 transitions. Word has length 131 [2024-11-11 21:07:02,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:07:02,446 INFO L471 AbstractCegarLoop]: Abstraction has 5190 states and 6402 transitions. [2024-11-11 21:07:02,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-11 21:07:02,446 INFO L276 IsEmpty]: Start isEmpty. Operand 5190 states and 6402 transitions. [2024-11-11 21:07:02,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-11 21:07:02,450 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:07:02,450 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 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, 1, 1, 1, 1, 1] [2024-11-11 21:07:02,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-11 21:07:02,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:07:02,650 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:07:02,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:07:02,651 INFO L85 PathProgramCache]: Analyzing trace with hash 844943966, now seen corresponding path program 1 times [2024-11-11 21:07:02,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:07:02,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427846732] [2024-11-11 21:07:02,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:07:02,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:07:02,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:02,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:07:02,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:02,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 21:07:02,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:02,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 21:07:02,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:02,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-11 21:07:02,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:02,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:07:02,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:02,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-11 21:07:02,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:02,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-11 21:07:02,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:02,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-11 21:07:02,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:02,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-11 21:07:02,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:02,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-11 21:07:02,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:02,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 21:07:02,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:02,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-11 21:07:02,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:02,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-11 21:07:02,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:02,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-11 21:07:02,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:02,745 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-11 21:07:02,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:07:02,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427846732] [2024-11-11 21:07:02,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427846732] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:07:02,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650927745] [2024-11-11 21:07:02,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:07:02,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:07:02,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:07:02,747 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:07:02,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-11 21:07:02,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:02,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 21:07:02,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:07:02,859 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-11 21:07:02,859 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 21:07:02,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650927745] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:07:02,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 21:07:02,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-11-11 21:07:02,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666222480] [2024-11-11 21:07:02,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:07:02,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:07:02,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:07:02,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:07:02,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:07:02,861 INFO L87 Difference]: Start difference. First operand 5190 states and 6402 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-11 21:07:03,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:07:03,160 INFO L93 Difference]: Finished difference Result 13673 states and 17010 transitions. [2024-11-11 21:07:03,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:07:03,164 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 154 [2024-11-11 21:07:03,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:07:03,194 INFO L225 Difference]: With dead ends: 13673 [2024-11-11 21:07:03,195 INFO L226 Difference]: Without dead ends: 8722 [2024-11-11 21:07:03,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:07:03,205 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 94 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:07:03,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 355 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:07:03,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8722 states. [2024-11-11 21:07:03,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8722 to 8718. [2024-11-11 21:07:03,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8718 states, 7074 states have (on average 1.1707661860333616) internal successors, (8282), 7130 states have internal predecessors, (8282), 947 states have call successors, (947), 643 states have call predecessors, (947), 696 states have return successors, (1365), 945 states have call predecessors, (1365), 945 states have call successors, (1365) [2024-11-11 21:07:03,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8718 states to 8718 states and 10594 transitions. [2024-11-11 21:07:03,588 INFO L78 Accepts]: Start accepts. Automaton has 8718 states and 10594 transitions. Word has length 154 [2024-11-11 21:07:03,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:07:03,589 INFO L471 AbstractCegarLoop]: Abstraction has 8718 states and 10594 transitions. [2024-11-11 21:07:03,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-11 21:07:03,589 INFO L276 IsEmpty]: Start isEmpty. Operand 8718 states and 10594 transitions. [2024-11-11 21:07:03,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-11 21:07:03,593 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:07:03,593 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 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, 1, 1, 1, 1, 1] [2024-11-11 21:07:03,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-11 21:07:03,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-11 21:07:03,797 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:07:03,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:07:03,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1688949468, now seen corresponding path program 1 times [2024-11-11 21:07:03,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:07:03,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734345168] [2024-11-11 21:07:03,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:07:03,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:07:03,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:03,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:07:03,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:03,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 21:07:03,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:03,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 21:07:03,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:03,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-11 21:07:03,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:03,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:07:03,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:03,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-11 21:07:03,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:03,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-11 21:07:03,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:03,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-11 21:07:03,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:03,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-11 21:07:03,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:03,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-11 21:07:03,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:03,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 21:07:03,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:03,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-11 21:07:03,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:03,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-11 21:07:03,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:03,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-11 21:07:03,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:03,903 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-11 21:07:03,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:07:03,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734345168] [2024-11-11 21:07:03,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734345168] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:07:03,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804815110] [2024-11-11 21:07:03,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:07:03,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:07:03,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:07:03,905 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:07:03,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-11 21:07:03,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:03,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-11 21:07:03,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:07:04,021 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-11 21:07:04,022 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 21:07:04,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [804815110] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:07:04,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 21:07:04,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2024-11-11 21:07:04,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064578916] [2024-11-11 21:07:04,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:07:04,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 21:07:04,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:07:04,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 21:07:04,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-11 21:07:04,024 INFO L87 Difference]: Start difference. First operand 8718 states and 10594 transitions. Second operand has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 21:07:04,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:07:04,179 INFO L93 Difference]: Finished difference Result 13822 states and 16809 transitions. [2024-11-11 21:07:04,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 21:07:04,180 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 154 [2024-11-11 21:07:04,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:07:04,196 INFO L225 Difference]: With dead ends: 13822 [2024-11-11 21:07:04,196 INFO L226 Difference]: Without dead ends: 5115 [2024-11-11 21:07:04,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-11 21:07:04,212 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:07:04,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 646 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:07:04,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5115 states. [2024-11-11 21:07:04,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5115 to 5115. [2024-11-11 21:07:04,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5115 states, 4342 states have (on average 1.1706586826347305) internal successors, (5083), 4354 states have internal predecessors, (5083), 440 states have call successors, (440), 276 states have call predecessors, (440), 332 states have return successors, (645), 484 states have call predecessors, (645), 438 states have call successors, (645) [2024-11-11 21:07:04,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5115 states to 5115 states and 6168 transitions. [2024-11-11 21:07:04,447 INFO L78 Accepts]: Start accepts. Automaton has 5115 states and 6168 transitions. Word has length 154 [2024-11-11 21:07:04,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:07:04,447 INFO L471 AbstractCegarLoop]: Abstraction has 5115 states and 6168 transitions. [2024-11-11 21:07:04,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 5 states have internal predecessors, (104), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 21:07:04,447 INFO L276 IsEmpty]: Start isEmpty. Operand 5115 states and 6168 transitions. [2024-11-11 21:07:04,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-11 21:07:04,451 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:07:04,451 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:07:04,465 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-11 21:07:04,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-11 21:07:04,656 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:07:04,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:07:04,657 INFO L85 PathProgramCache]: Analyzing trace with hash -493377335, now seen corresponding path program 1 times [2024-11-11 21:07:04,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:07:04,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825968506] [2024-11-11 21:07:04,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:07:04,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:07:04,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:04,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:07:04,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:04,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 21:07:04,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:04,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 21:07:04,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:04,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-11 21:07:04,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:04,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:07:04,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:04,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-11 21:07:04,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:04,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-11 21:07:04,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:04,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-11 21:07:04,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:04,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-11 21:07:04,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:04,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-11 21:07:04,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:04,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-11 21:07:04,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:04,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 21:07:04,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:04,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-11 21:07:04,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:04,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-11 21:07:04,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:04,777 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-11-11 21:07:04,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:07:04,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825968506] [2024-11-11 21:07:04,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825968506] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:07:04,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:07:04,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:07:04,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221298204] [2024-11-11 21:07:04,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:07:04,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:07:04,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:07:04,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:07:04,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:07:04,779 INFO L87 Difference]: Start difference. First operand 5115 states and 6168 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 21:07:05,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:07:05,078 INFO L93 Difference]: Finished difference Result 5302 states and 6385 transitions. [2024-11-11 21:07:05,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:07:05,078 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 158 [2024-11-11 21:07:05,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:07:05,095 INFO L225 Difference]: With dead ends: 5302 [2024-11-11 21:07:05,095 INFO L226 Difference]: Without dead ends: 5025 [2024-11-11 21:07:05,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:07:05,099 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 94 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:07:05,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 291 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:07:05,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5025 states. [2024-11-11 21:07:05,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5025 to 4841. [2024-11-11 21:07:05,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4841 states, 4110 states have (on average 1.1734793187347932) internal successors, (4823), 4121 states have internal predecessors, (4823), 417 states have call successors, (417), 260 states have call predecessors, (417), 313 states have return successors, (619), 459 states have call predecessors, (619), 415 states have call successors, (619) [2024-11-11 21:07:05,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4841 states to 4841 states and 5859 transitions. [2024-11-11 21:07:05,383 INFO L78 Accepts]: Start accepts. Automaton has 4841 states and 5859 transitions. Word has length 158 [2024-11-11 21:07:05,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:07:05,383 INFO L471 AbstractCegarLoop]: Abstraction has 4841 states and 5859 transitions. [2024-11-11 21:07:05,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 21:07:05,384 INFO L276 IsEmpty]: Start isEmpty. Operand 4841 states and 5859 transitions. [2024-11-11 21:07:05,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-11 21:07:05,386 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:07:05,387 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:07:05,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-11 21:07:05,387 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:07:05,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:07:05,387 INFO L85 PathProgramCache]: Analyzing trace with hash -850407883, now seen corresponding path program 1 times [2024-11-11 21:07:05,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:07:05,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505039944] [2024-11-11 21:07:05,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:07:05,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:07:05,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:05,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:07:05,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:05,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 21:07:05,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:05,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 21:07:05,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:05,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-11 21:07:05,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:05,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:07:05,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:05,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-11 21:07:05,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:05,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-11 21:07:05,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:05,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 21:07:05,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:05,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-11 21:07:05,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:05,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-11 21:07:05,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:05,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-11 21:07:05,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:05,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-11 21:07:05,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:05,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-11 21:07:05,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:05,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-11 21:07:05,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:05,474 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 21 proven. 5 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-11-11 21:07:05,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:07:05,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505039944] [2024-11-11 21:07:05,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505039944] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:07:05,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435207653] [2024-11-11 21:07:05,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:07:05,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:07:05,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:07:05,476 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:07:05,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-11 21:07:05,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:05,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 21:07:05,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:07:05,652 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-11-11 21:07:05,653 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 21:07:05,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435207653] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:07:05,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 21:07:05,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2024-11-11 21:07:05,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885362943] [2024-11-11 21:07:05,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:07:05,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:07:05,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:07:05,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:07:05,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:07:05,655 INFO L87 Difference]: Start difference. First operand 4841 states and 5859 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 21:07:05,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:07:05,866 INFO L93 Difference]: Finished difference Result 9087 states and 11040 transitions. [2024-11-11 21:07:05,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:07:05,866 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 164 [2024-11-11 21:07:05,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:07:05,882 INFO L225 Difference]: With dead ends: 9087 [2024-11-11 21:07:05,883 INFO L226 Difference]: Without dead ends: 4503 [2024-11-11 21:07:05,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:07:05,890 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 25 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:07:05,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 253 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:07:05,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4503 states. [2024-11-11 21:07:06,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4503 to 4503. [2024-11-11 21:07:06,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4503 states, 3841 states have (on average 1.1759958344181203) internal successors, (4517), 3852 states have internal predecessors, (4517), 377 states have call successors, (377), 234 states have call predecessors, (377), 284 states have return successors, (568), 416 states have call predecessors, (568), 375 states have call successors, (568) [2024-11-11 21:07:06,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4503 states to 4503 states and 5462 transitions. [2024-11-11 21:07:06,135 INFO L78 Accepts]: Start accepts. Automaton has 4503 states and 5462 transitions. Word has length 164 [2024-11-11 21:07:06,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:07:06,135 INFO L471 AbstractCegarLoop]: Abstraction has 4503 states and 5462 transitions. [2024-11-11 21:07:06,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 21:07:06,136 INFO L276 IsEmpty]: Start isEmpty. Operand 4503 states and 5462 transitions. [2024-11-11 21:07:06,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-11 21:07:06,137 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:07:06,138 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:07:06,150 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-11 21:07:06,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-11 21:07:06,342 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:07:06,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:07:06,343 INFO L85 PathProgramCache]: Analyzing trace with hash 990777910, now seen corresponding path program 1 times [2024-11-11 21:07:06,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:07:06,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857659624] [2024-11-11 21:07:06,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:07:06,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:07:06,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:06,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:07:06,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:06,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 21:07:06,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:06,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 21:07:06,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:06,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-11 21:07:06,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:06,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:07:06,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:06,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-11 21:07:06,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:06,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-11 21:07:06,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:06,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 21:07:06,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:06,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-11 21:07:06,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:06,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-11 21:07:06,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:06,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-11 21:07:06,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:06,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-11 21:07:06,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:06,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-11 21:07:06,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:06,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-11 21:07:06,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:06,430 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 26 proven. 5 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-11 21:07:06,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:07:06,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857659624] [2024-11-11 21:07:06,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857659624] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:07:06,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735268748] [2024-11-11 21:07:06,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:07:06,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:07:06,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:07:06,432 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:07:06,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-11 21:07:06,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:06,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 21:07:06,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:07:06,542 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-11 21:07:06,542 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 21:07:06,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735268748] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:07:06,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 21:07:06,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2024-11-11 21:07:06,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199349233] [2024-11-11 21:07:06,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:07:06,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:07:06,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:07:06,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:07:06,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:07:06,545 INFO L87 Difference]: Start difference. First operand 4503 states and 5462 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-11 21:07:06,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:07:06,669 INFO L93 Difference]: Finished difference Result 8682 states and 10665 transitions. [2024-11-11 21:07:06,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:07:06,670 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 164 [2024-11-11 21:07:06,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:07:06,683 INFO L225 Difference]: With dead ends: 8682 [2024-11-11 21:07:06,683 INFO L226 Difference]: Without dead ends: 4330 [2024-11-11 21:07:06,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:07:06,688 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 84 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:07:06,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 292 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:07:06,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4330 states. [2024-11-11 21:07:06,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4330 to 4327. [2024-11-11 21:07:06,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4327 states, 3665 states have (on average 1.1607094133697136) internal successors, (4254), 3676 states have internal predecessors, (4254), 377 states have call successors, (377), 234 states have call predecessors, (377), 284 states have return successors, (568), 416 states have call predecessors, (568), 375 states have call successors, (568) [2024-11-11 21:07:06,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4327 states to 4327 states and 5199 transitions. [2024-11-11 21:07:06,839 INFO L78 Accepts]: Start accepts. Automaton has 4327 states and 5199 transitions. Word has length 164 [2024-11-11 21:07:06,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:07:06,840 INFO L471 AbstractCegarLoop]: Abstraction has 4327 states and 5199 transitions. [2024-11-11 21:07:06,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-11 21:07:06,840 INFO L276 IsEmpty]: Start isEmpty. Operand 4327 states and 5199 transitions. [2024-11-11 21:07:06,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-11 21:07:06,842 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:07:06,842 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:07:06,854 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-11 21:07:07,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:07:07,042 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:07:07,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:07:07,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1614442849, now seen corresponding path program 1 times [2024-11-11 21:07:07,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:07:07,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280424251] [2024-11-11 21:07:07,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:07:07,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:07:07,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:07,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:07:07,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:07,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 21:07:07,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:07,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 21:07:07,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:07,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-11 21:07:07,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:07,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:07:07,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:07,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-11 21:07:07,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:07,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-11 21:07:07,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:07,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 21:07:07,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:07,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-11 21:07:07,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:07,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-11 21:07:07,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:07,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-11 21:07:07,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:07,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-11 21:07:07,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:07,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-11 21:07:07,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:07,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-11 21:07:07,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:07,140 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-11 21:07:07,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:07:07,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280424251] [2024-11-11 21:07:07,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280424251] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:07:07,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:07:07,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 21:07:07,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097470341] [2024-11-11 21:07:07,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:07:07,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 21:07:07,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:07:07,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 21:07:07,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:07:07,142 INFO L87 Difference]: Start difference. First operand 4327 states and 5199 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 5 states have internal predecessors, (93), 3 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 21:07:07,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:07:07,428 INFO L93 Difference]: Finished difference Result 9311 states and 11202 transitions. [2024-11-11 21:07:07,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 21:07:07,429 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 5 states have internal predecessors, (93), 3 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 165 [2024-11-11 21:07:07,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:07:07,444 INFO L225 Difference]: With dead ends: 9311 [2024-11-11 21:07:07,444 INFO L226 Difference]: Without dead ends: 5031 [2024-11-11 21:07:07,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-11 21:07:07,451 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 145 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:07:07,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 632 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:07:07,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5031 states. [2024-11-11 21:07:07,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5031 to 4783. [2024-11-11 21:07:07,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4783 states, 4052 states have (on average 1.1581934846989141) internal successors, (4693), 4067 states have internal predecessors, (4693), 415 states have call successors, (415), 257 states have call predecessors, (415), 315 states have return successors, (623), 458 states have call predecessors, (623), 413 states have call successors, (623) [2024-11-11 21:07:07,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4783 states to 4783 states and 5731 transitions. [2024-11-11 21:07:07,617 INFO L78 Accepts]: Start accepts. Automaton has 4783 states and 5731 transitions. Word has length 165 [2024-11-11 21:07:07,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:07:07,617 INFO L471 AbstractCegarLoop]: Abstraction has 4783 states and 5731 transitions. [2024-11-11 21:07:07,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 5 states have internal predecessors, (93), 3 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 21:07:07,618 INFO L276 IsEmpty]: Start isEmpty. Operand 4783 states and 5731 transitions. [2024-11-11 21:07:07,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-11 21:07:07,620 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:07:07,621 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:07:07,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-11 21:07:07,621 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:07:07,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:07:07,621 INFO L85 PathProgramCache]: Analyzing trace with hash 2040758312, now seen corresponding path program 1 times [2024-11-11 21:07:07,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:07:07,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186617793] [2024-11-11 21:07:07,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:07:07,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:07:07,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:07,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:07:07,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:07,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 21:07:07,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:07,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 21:07:07,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:07,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-11 21:07:07,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:07,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:07:07,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:07,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-11 21:07:07,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:07,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-11 21:07:07,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:07,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-11 21:07:07,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:07,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-11 21:07:07,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:07,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 21:07:07,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:07,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-11 21:07:07,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:07,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-11 21:07:07,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:07,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-11 21:07:07,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:07,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-11 21:07:07,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:07,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-11 21:07:07,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:07,682 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 40 proven. 6 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2024-11-11 21:07:07,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:07:07,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186617793] [2024-11-11 21:07:07,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186617793] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:07:07,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612788765] [2024-11-11 21:07:07,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:07:07,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:07:07,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:07:07,685 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:07:07,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-11 21:07:07,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:07,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 21:07:07,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:07:07,838 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-11 21:07:07,838 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 21:07:07,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612788765] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:07:07,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 21:07:07,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-11 21:07:07,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117807999] [2024-11-11 21:07:07,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:07:07,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:07:07,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:07:07,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:07:07,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:07:07,840 INFO L87 Difference]: Start difference. First operand 4783 states and 5731 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-11 21:07:08,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:07:08,008 INFO L93 Difference]: Finished difference Result 8862 states and 10649 transitions. [2024-11-11 21:07:08,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:07:08,009 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 170 [2024-11-11 21:07:08,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:07:08,025 INFO L225 Difference]: With dead ends: 8862 [2024-11-11 21:07:08,026 INFO L226 Difference]: Without dead ends: 4169 [2024-11-11 21:07:08,031 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:07:08,032 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 58 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:07:08,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 278 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:07:08,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4169 states. [2024-11-11 21:07:08,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4169 to 3893. [2024-11-11 21:07:08,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3893 states, 3313 states have (on average 1.15333534560821) internal successors, (3821), 3324 states have internal predecessors, (3821), 329 states have call successors, (329), 203 states have call predecessors, (329), 250 states have return successors, (444), 365 states have call predecessors, (444), 327 states have call successors, (444) [2024-11-11 21:07:08,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3893 states to 3893 states and 4594 transitions. [2024-11-11 21:07:08,171 INFO L78 Accepts]: Start accepts. Automaton has 3893 states and 4594 transitions. Word has length 170 [2024-11-11 21:07:08,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:07:08,171 INFO L471 AbstractCegarLoop]: Abstraction has 3893 states and 4594 transitions. [2024-11-11 21:07:08,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-11 21:07:08,172 INFO L276 IsEmpty]: Start isEmpty. Operand 3893 states and 4594 transitions. [2024-11-11 21:07:08,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-11 21:07:08,173 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:07:08,173 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:07:08,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-11 21:07:08,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-11 21:07:08,375 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:07:08,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:07:08,375 INFO L85 PathProgramCache]: Analyzing trace with hash -606151675, now seen corresponding path program 1 times [2024-11-11 21:07:08,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:07:08,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894701298] [2024-11-11 21:07:08,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:07:08,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:07:08,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:08,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:07:08,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:08,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 21:07:08,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:08,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 21:07:08,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:08,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-11 21:07:08,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:08,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:07:08,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:08,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-11 21:07:08,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:08,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-11 21:07:08,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:08,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-11 21:07:08,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:08,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-11 21:07:08,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:08,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 21:07:08,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:08,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-11 21:07:08,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:08,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-11 21:07:08,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:08,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-11 21:07:08,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:08,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-11 21:07:08,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:08,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-11 21:07:08,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:08,430 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 40 proven. 7 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-11-11 21:07:08,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:07:08,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894701298] [2024-11-11 21:07:08,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894701298] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:07:08,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206017207] [2024-11-11 21:07:08,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:07:08,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:07:08,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:07:08,432 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:07:08,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-11 21:07:08,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:08,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 21:07:08,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:07:08,553 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-11 21:07:08,553 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 21:07:08,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206017207] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:07:08,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 21:07:08,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2024-11-11 21:07:08,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548629885] [2024-11-11 21:07:08,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:07:08,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:07:08,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:07:08,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:07:08,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:07:08,555 INFO L87 Difference]: Start difference. First operand 3893 states and 4594 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-11 21:07:08,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:07:08,662 INFO L93 Difference]: Finished difference Result 4506 states and 5322 transitions. [2024-11-11 21:07:08,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:07:08,662 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 170 [2024-11-11 21:07:08,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:07:08,675 INFO L225 Difference]: With dead ends: 4506 [2024-11-11 21:07:08,675 INFO L226 Difference]: Without dead ends: 3896 [2024-11-11 21:07:08,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:07:08,677 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 51 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:07:08,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 332 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:07:08,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3896 states. [2024-11-11 21:07:08,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3896 to 3893. [2024-11-11 21:07:08,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3893 states, 3313 states have (on average 1.1494114095985513) internal successors, (3808), 3324 states have internal predecessors, (3808), 329 states have call successors, (329), 203 states have call predecessors, (329), 250 states have return successors, (444), 365 states have call predecessors, (444), 327 states have call successors, (444) [2024-11-11 21:07:08,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3893 states to 3893 states and 4581 transitions. [2024-11-11 21:07:08,812 INFO L78 Accepts]: Start accepts. Automaton has 3893 states and 4581 transitions. Word has length 170 [2024-11-11 21:07:08,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:07:08,814 INFO L471 AbstractCegarLoop]: Abstraction has 3893 states and 4581 transitions. [2024-11-11 21:07:08,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-11 21:07:08,814 INFO L276 IsEmpty]: Start isEmpty. Operand 3893 states and 4581 transitions. [2024-11-11 21:07:08,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-11 21:07:08,815 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:07:08,816 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:07:08,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-11 21:07:09,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:07:09,021 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:07:09,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:07:09,021 INFO L85 PathProgramCache]: Analyzing trace with hash -635607035, now seen corresponding path program 1 times [2024-11-11 21:07:09,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:07:09,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243350894] [2024-11-11 21:07:09,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:07:09,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:07:09,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:09,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:07:09,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:09,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 21:07:09,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:09,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 21:07:09,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:09,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-11 21:07:09,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:09,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:07:09,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:09,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-11 21:07:09,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:09,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-11 21:07:09,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:09,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-11 21:07:09,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:09,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-11 21:07:09,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:09,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 21:07:09,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:09,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 21:07:09,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:09,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-11 21:07:09,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:09,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-11 21:07:09,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:09,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-11 21:07:09,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:09,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-11 21:07:09,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:09,125 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-11-11 21:07:09,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:07:09,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243350894] [2024-11-11 21:07:09,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243350894] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:07:09,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917258760] [2024-11-11 21:07:09,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:07:09,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:07:09,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:07:09,128 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:07:09,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-11 21:07:09,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:09,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-11 21:07:09,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:07:09,351 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-11-11 21:07:09,352 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:07:09,480 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-11-11 21:07:09,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [917258760] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:07:09,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:07:09,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6 [2024-11-11 21:07:09,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382627952] [2024-11-11 21:07:09,481 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:07:09,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 21:07:09,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:07:09,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 21:07:09,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:07:09,482 INFO L87 Difference]: Start difference. First operand 3893 states and 4581 transitions. Second operand has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 5 states have internal predecessors, (136), 3 states have call successors, (30), 5 states have call predecessors, (30), 3 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-11 21:07:09,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:07:09,800 INFO L93 Difference]: Finished difference Result 6951 states and 8184 transitions. [2024-11-11 21:07:09,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 21:07:09,801 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 5 states have internal predecessors, (136), 3 states have call successors, (30), 5 states have call predecessors, (30), 3 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 172 [2024-11-11 21:07:09,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:07:09,813 INFO L225 Difference]: With dead ends: 6951 [2024-11-11 21:07:09,813 INFO L226 Difference]: Without dead ends: 4339 [2024-11-11 21:07:09,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:07:09,816 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 189 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:07:09,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 702 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:07:09,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4339 states. [2024-11-11 21:07:09,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4339 to 4184. [2024-11-11 21:07:09,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4184 states, 3559 states have (on average 1.1469513908401237) internal successors, (4082), 3570 states have internal predecessors, (4082), 355 states have call successors, (355), 219 states have call predecessors, (355), 269 states have return successors, (474), 394 states have call predecessors, (474), 353 states have call successors, (474) [2024-11-11 21:07:09,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4184 states to 4184 states and 4911 transitions. [2024-11-11 21:07:09,962 INFO L78 Accepts]: Start accepts. Automaton has 4184 states and 4911 transitions. Word has length 172 [2024-11-11 21:07:09,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:07:09,963 INFO L471 AbstractCegarLoop]: Abstraction has 4184 states and 4911 transitions. [2024-11-11 21:07:09,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 5 states have internal predecessors, (136), 3 states have call successors, (30), 5 states have call predecessors, (30), 3 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-11 21:07:09,963 INFO L276 IsEmpty]: Start isEmpty. Operand 4184 states and 4911 transitions. [2024-11-11 21:07:09,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-11 21:07:09,970 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:07:09,970 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 7, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2024-11-11 21:07:09,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-11 21:07:10,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-11 21:07:10,171 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:07:10,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:07:10,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1410851743, now seen corresponding path program 1 times [2024-11-11 21:07:10,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:07:10,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526226393] [2024-11-11 21:07:10,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:07:10,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:07:10,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:10,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:07:10,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:10,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 21:07:10,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:10,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 21:07:10,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:10,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-11 21:07:10,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:10,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:07:10,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:10,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-11 21:07:10,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:10,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-11 21:07:10,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:10,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-11 21:07:10,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:10,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-11 21:07:10,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:10,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 21:07:10,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:10,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 21:07:10,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:10,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-11 21:07:10,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:10,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-11 21:07:10,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:10,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-11 21:07:10,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:10,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-11 21:07:10,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:10,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-11 21:07:10,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:10,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-11 21:07:10,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:10,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-11 21:07:10,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:10,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-11-11 21:07:10,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:10,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-11 21:07:10,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:10,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2024-11-11 21:07:10,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:10,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2024-11-11 21:07:10,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:10,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2024-11-11 21:07:10,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:10,276 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 113 proven. 30 refuted. 0 times theorem prover too weak. 307 trivial. 0 not checked. [2024-11-11 21:07:10,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:07:10,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526226393] [2024-11-11 21:07:10,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526226393] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:07:10,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967070950] [2024-11-11 21:07:10,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:07:10,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:07:10,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:07:10,279 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:07:10,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-11 21:07:10,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:10,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 647 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 21:07:10,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:07:10,438 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 319 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2024-11-11 21:07:10,438 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 21:07:10,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967070950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:07:10,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 21:07:10,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-11 21:07:10,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793901206] [2024-11-11 21:07:10,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:07:10,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:07:10,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:07:10,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:07:10,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:07:10,440 INFO L87 Difference]: Start difference. First operand 4184 states and 4911 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-11 21:07:10,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:07:10,630 INFO L93 Difference]: Finished difference Result 10503 states and 12364 transitions. [2024-11-11 21:07:10,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:07:10,631 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 252 [2024-11-11 21:07:10,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:07:10,649 INFO L225 Difference]: With dead ends: 10503 [2024-11-11 21:07:10,649 INFO L226 Difference]: Without dead ends: 6523 [2024-11-11 21:07:10,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:07:10,655 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 61 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:07:10,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 339 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:07:10,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6523 states. [2024-11-11 21:07:10,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6523 to 6406. [2024-11-11 21:07:10,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6406 states, 5441 states have (on average 1.139680205844514) internal successors, (6201), 5452 states have internal predecessors, (6201), 561 states have call successors, (561), 346 states have call predecessors, (561), 403 states have return successors, (711), 607 states have call predecessors, (711), 559 states have call successors, (711) [2024-11-11 21:07:10,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6406 states to 6406 states and 7473 transitions. [2024-11-11 21:07:10,884 INFO L78 Accepts]: Start accepts. Automaton has 6406 states and 7473 transitions. Word has length 252 [2024-11-11 21:07:10,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:07:10,885 INFO L471 AbstractCegarLoop]: Abstraction has 6406 states and 7473 transitions. [2024-11-11 21:07:10,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-11 21:07:10,885 INFO L276 IsEmpty]: Start isEmpty. Operand 6406 states and 7473 transitions. [2024-11-11 21:07:10,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-11 21:07:10,890 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:07:10,890 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 7, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2024-11-11 21:07:10,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-11 21:07:11,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-11 21:07:11,091 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:07:11,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:07:11,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1078208605, now seen corresponding path program 1 times [2024-11-11 21:07:11,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:07:11,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777507412] [2024-11-11 21:07:11,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:07:11,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:07:11,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:11,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:07:11,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:11,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 21:07:11,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:11,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-11 21:07:11,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:11,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-11 21:07:11,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:11,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:07:11,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:11,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-11 21:07:11,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:11,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-11 21:07:11,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:11,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-11 21:07:11,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:11,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-11 21:07:11,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:11,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 21:07:11,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:11,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 21:07:11,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:11,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-11 21:07:11,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:11,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-11 21:07:11,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:11,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-11 21:07:11,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:11,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-11 21:07:11,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:11,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-11 21:07:11,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:11,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-11 21:07:11,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:11,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-11 21:07:11,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:11,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-11-11 21:07:11,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:11,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-11 21:07:11,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:11,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2024-11-11 21:07:11,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:11,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2024-11-11 21:07:11,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:11,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2024-11-11 21:07:11,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:11,151 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 94 proven. 13 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2024-11-11 21:07:11,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:07:11,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777507412] [2024-11-11 21:07:11,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777507412] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:07:11,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863100567] [2024-11-11 21:07:11,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:07:11,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:07:11,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:07:11,153 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:07:11,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-11 21:07:11,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:07:11,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 644 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 21:07:11,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:07:11,281 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 279 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2024-11-11 21:07:11,282 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 21:07:11,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863100567] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:07:11,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 21:07:11,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2024-11-11 21:07:11,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86442447] [2024-11-11 21:07:11,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:07:11,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:07:11,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:07:11,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:07:11,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:07:11,284 INFO L87 Difference]: Start difference. First operand 6406 states and 7473 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-11 21:07:11,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:07:11,451 INFO L93 Difference]: Finished difference Result 8806 states and 10273 transitions. [2024-11-11 21:07:11,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:07:11,454 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 252 [2024-11-11 21:07:11,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:07:11,469 INFO L225 Difference]: With dead ends: 8806 [2024-11-11 21:07:11,469 INFO L226 Difference]: Without dead ends: 2546 [2024-11-11 21:07:11,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:07:11,478 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 7 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:07:11,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 270 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:07:11,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2546 states. [2024-11-11 21:07:11,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2546 to 2546. [2024-11-11 21:07:11,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2546 states, 2145 states have (on average 1.116083916083916) internal successors, (2394), 2158 states have internal predecessors, (2394), 220 states have call successors, (220), 149 states have call predecessors, (220), 180 states have return successors, (280), 238 states have call predecessors, (280), 218 states have call successors, (280) [2024-11-11 21:07:11,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2546 states to 2546 states and 2894 transitions. [2024-11-11 21:07:11,648 INFO L78 Accepts]: Start accepts. Automaton has 2546 states and 2894 transitions. Word has length 252 [2024-11-11 21:07:11,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:07:11,649 INFO L471 AbstractCegarLoop]: Abstraction has 2546 states and 2894 transitions. [2024-11-11 21:07:11,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-11 21:07:11,650 INFO L276 IsEmpty]: Start isEmpty. Operand 2546 states and 2894 transitions. [2024-11-11 21:07:11,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2024-11-11 21:07:11,653 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:07:11,653 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:07:11,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-11 21:07:11,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-11 21:07:11,854 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:07:11,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:07:11,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1480841608, now seen corresponding path program 1 times [2024-11-11 21:07:11,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:07:11,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353032938] [2024-11-11 21:07:11,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:07:11,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:07:11,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-11 21:07:11,874 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-11 21:07:11,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-11 21:07:11,950 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-11 21:07:11,950 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-11 21:07:11,951 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 21:07:11,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-11 21:07:11,955 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:07:12,074 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 21:07:12,076 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 09:07:12 BoogieIcfgContainer [2024-11-11 21:07:12,076 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 21:07:12,077 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 21:07:12,077 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 21:07:12,077 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 21:07:12,077 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:06:54" (3/4) ... [2024-11-11 21:07:12,078 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-11 21:07:12,212 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-11 21:07:12,212 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 21:07:12,213 INFO L158 Benchmark]: Toolchain (without parser) took 18627.96ms. Allocated memory was 195.0MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 125.0MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 276.2MB. Max. memory is 16.1GB. [2024-11-11 21:07:12,213 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 121.6MB. Free memory is still 85.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 21:07:12,213 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.82ms. Allocated memory is still 195.0MB. Free memory was 124.7MB in the beginning and 109.6MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-11 21:07:12,213 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.54ms. Allocated memory is still 195.0MB. Free memory was 109.4MB in the beginning and 107.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 21:07:12,213 INFO L158 Benchmark]: Boogie Preprocessor took 36.88ms. Allocated memory is still 195.0MB. Free memory was 107.3MB in the beginning and 104.8MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-11 21:07:12,214 INFO L158 Benchmark]: RCFGBuilder took 377.99ms. Allocated memory is still 195.0MB. Free memory was 104.8MB in the beginning and 83.9MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-11 21:07:12,214 INFO L158 Benchmark]: TraceAbstraction took 17809.46ms. Allocated memory was 195.0MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 83.1MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 209.1MB. Max. memory is 16.1GB. [2024-11-11 21:07:12,214 INFO L158 Benchmark]: Witness Printer took 135.59ms. Allocated memory is still 2.5GB. Free memory was 2.2GB in the beginning and 2.1GB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-11 21:07:12,215 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.15ms. Allocated memory is still 121.6MB. Free memory is still 85.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 235.82ms. Allocated memory is still 195.0MB. Free memory was 124.7MB in the beginning and 109.6MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.54ms. Allocated memory is still 195.0MB. Free memory was 109.4MB in the beginning and 107.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.88ms. Allocated memory is still 195.0MB. Free memory was 107.3MB in the beginning and 104.8MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 377.99ms. Allocated memory is still 195.0MB. Free memory was 104.8MB in the beginning and 83.9MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 17809.46ms. Allocated memory was 195.0MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 83.1MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 209.1MB. Max. memory is 16.1GB. * Witness Printer took 135.59ms. Allocated memory is still 2.5GB. Free memory was 2.2GB in the beginning and 2.1GB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. 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: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L25] int max_loop ; [L26] int num ; [L27] int i ; [L28] int e ; [L29] int timer ; [L30] char data_0 ; [L31] char data_1 ; [L74] int P_1_pc; [L75] int P_1_st ; [L76] int P_1_i ; [L77] int P_1_ev ; [L132] int C_1_pc ; [L133] int C_1_st ; [L134] int C_1_i ; [L135] int C_1_ev ; [L136] int C_1_pr ; VAL [C_1_ev=0, C_1_i=0, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=0, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=0, num=0, timer=0] [L500] int count ; [L501] int __retres2 ; [L505] num = 0 [L506] i = 0 [L507] max_loop = 2 [L509] timer = 0 [L510] P_1_pc = 0 [L511] C_1_pc = 0 [L513] count = 0 [L514] CALL init_model() [L493] P_1_i = 1 [L494] C_1_i = 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L514] RET init_model() [L515] CALL start_simulation() [L431] int kernel_st ; [L432] int tmp ; [L433] int tmp___0 ; [L437] kernel_st = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L438] FCALL update_channels() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L439] CALL init_threads() [L236] COND TRUE (int )P_1_i == 1 [L237] P_1_st = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L241] COND TRUE (int )C_1_i == 1 [L242] C_1_st = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L439] RET init_threads() [L440] FCALL fire_delta_events() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L441] CALL activate_threads() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L375] int tmp ; [L376] int tmp___0 ; [L377] int tmp___1 ; [L381] CALL, EXPR is_P_1_triggered() [L114] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L117] COND FALSE !((int )P_1_pc == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L127] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, __retres1=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L129] return (__retres1); VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, \result=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L381] RET, EXPR is_P_1_triggered() [L381] tmp = is_P_1_triggered() [L383] COND FALSE !(\read(tmp)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L389] CALL, EXPR is_C_1_triggered() [L196] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L199] COND FALSE !((int )C_1_pc == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L209] COND FALSE !((int )C_1_pc == 2) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L219] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, __retres1=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L221] return (__retres1); VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, \result=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L389] RET, EXPR is_C_1_triggered() [L389] tmp___1 = is_C_1_triggered() [L391] COND FALSE !(\read(tmp___1)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L441] RET activate_threads() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L442] FCALL reset_delta_events() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L445] COND TRUE 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L448] kernel_st = 1 [L449] CALL eval() [L272] int tmp ; [L273] int tmp___0 ; [L274] int tmp___1 ; [L275] int tmp___2 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L279] COND TRUE 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L251] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, __retres1=1, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L268] return (__retres1); VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \result=1, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L282] tmp___2 = exists_runnable_thread() [L284] COND TRUE \read(tmp___2) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L289] COND TRUE (int )P_1_st == 0 [L291] tmp = __VERIFIER_nondet_int() [L293] COND FALSE !(\read(tmp)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L304] COND TRUE (int )C_1_st == 0 [L306] tmp___1 = __VERIFIER_nondet_int() [L308] COND TRUE \read(tmp___1) [L310] C_1_st = 1 [L311] CALL C_1() [L138] char c ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L141] COND TRUE (int )C_1_pc == 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L156] COND TRUE i < max_loop VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L158] COND TRUE num == 0 [L159] timer = 1 [L160] i += 1 [L161] C_1_pc = 1 [L162] C_1_st = 2 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1] [L311] RET C_1() [L279] COND TRUE 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1] [L251] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1] [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, __retres1=1, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1] [L268] return (__retres1); VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \result=1, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1] [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1] [L282] tmp___2 = exists_runnable_thread() [L284] COND TRUE \read(tmp___2) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1] [L289] COND TRUE (int )P_1_st == 0 [L291] tmp = __VERIFIER_nondet_int() [L293] COND TRUE \read(tmp) [L295] P_1_st = 1 [L296] CALL P_1() [L82] COND TRUE (int )P_1_pc == 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1] [L93] COND TRUE i < max_loop VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1] [L96] CALL write_data(num, 'A') [L59] COND TRUE i___0 == 0 [L60] data_0 = c VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1] [L96] RET write_data(num, 'A') [L97] num += 1 [L98] P_1_pc = 1 [L99] P_1_st = 2 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L296] RET P_1() [L304] COND FALSE !((int )C_1_st == 0) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L279] COND TRUE 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L251] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L254] COND FALSE !((int )P_1_st == 0) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L258] COND FALSE !((int )C_1_st == 0) [L266] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, __retres1=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L268] return (__retres1); VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \result=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L282] tmp___2 = exists_runnable_thread() [L284] COND FALSE !(\read(tmp___2)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L449] RET eval() [L452] kernel_st = 2 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L453] FCALL update_channels() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L456] kernel_st = 3 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L457] FCALL fire_delta_events() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L458] CALL activate_threads() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L375] int tmp ; [L376] int tmp___0 ; [L377] int tmp___1 ; [L381] CALL, EXPR is_P_1_triggered() [L114] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L117] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L118] COND FALSE !((int )P_1_ev == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L127] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, __retres1=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L129] return (__retres1); VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, \result=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L381] RET, EXPR is_P_1_triggered() [L381] tmp = is_P_1_triggered() [L383] COND FALSE !(\read(tmp)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L389] CALL, EXPR is_C_1_triggered() [L196] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L199] COND TRUE (int )C_1_pc == 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L200] COND FALSE !((int )e == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L209] COND FALSE !((int )C_1_pc == 2) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L219] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, __retres1=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L221] return (__retres1); VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, \result=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L389] RET, EXPR is_C_1_triggered() [L389] tmp___1 = is_C_1_triggered() [L391] COND FALSE !(\read(tmp___1)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L458] RET activate_threads() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L459] FCALL reset_delta_events() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L462] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L251] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L254] COND FALSE !((int )P_1_st == 0) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L258] COND FALSE !((int )C_1_st == 0) [L266] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, __retres1=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L268] return (__retres1); VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \result=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L462] RET, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L462] tmp = exists_runnable_thread() [L464] COND TRUE tmp == 0 [L466] kernel_st = 4 [L467] CALL fire_time_events() [L346] C_1_ev = 1 [L348] P_1_ev = 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L467] RET fire_time_events() [L468] CALL activate_threads() VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L375] int tmp ; [L376] int tmp___0 ; [L377] int tmp___1 ; [L381] CALL, EXPR is_P_1_triggered() [L114] int __retres1 ; VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L117] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L118] COND TRUE (int )P_1_ev == 1 [L119] __retres1 = 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, __retres1=1, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L129] return (__retres1); VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, \result=1, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L381] RET, EXPR is_P_1_triggered() [L381] tmp = is_P_1_triggered() [L383] COND TRUE \read(tmp) [L384] P_1_st = 0 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L389] CALL, EXPR is_C_1_triggered() [L196] int __retres1 ; VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L199] COND TRUE (int )C_1_pc == 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L200] COND FALSE !((int )e == 1) VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L209] COND FALSE !((int )C_1_pc == 2) VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L219] __retres1 = 0 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, __retres1=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L221] return (__retres1); VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, \result=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L389] RET, EXPR is_C_1_triggered() [L389] tmp___1 = is_C_1_triggered() [L391] COND FALSE !(\read(tmp___1)) VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L468] RET activate_threads() VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L469] CALL reset_time_events() [L360] COND TRUE (int )P_1_ev == 1 [L361] P_1_ev = 2 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L365] COND TRUE (int )C_1_ev == 1 [L366] C_1_ev = 2 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L469] RET reset_time_events() [L475] CALL, EXPR stop_simulation() [L412] int tmp ; [L413] int __retres2 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L417] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L251] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, __retres1=1, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L268] return (__retres1); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, \result=1, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L417] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L417] tmp = exists_runnable_thread() [L419] COND TRUE \read(tmp) [L420] __retres2 = 0 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, __retres2=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L427] return (__retres2); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, \result=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L475] RET, EXPR stop_simulation() [L475] tmp___0 = stop_simulation() [L477] COND FALSE !(\read(tmp___0)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L445] COND TRUE 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L448] kernel_st = 1 [L449] CALL eval() [L272] int tmp ; [L273] int tmp___0 ; [L274] int tmp___1 ; [L275] int tmp___2 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L279] COND TRUE 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L251] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, __retres1=1, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L268] return (__retres1); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, \result=1, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L282] tmp___2 = exists_runnable_thread() [L284] COND TRUE \read(tmp___2) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L289] COND TRUE (int )P_1_st == 0 [L291] tmp = __VERIFIER_nondet_int() [L293] COND TRUE \read(tmp) [L295] P_1_st = 1 [L296] CALL P_1() [L82] COND FALSE !((int )P_1_pc == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L85] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L93] COND TRUE i < max_loop VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L96] CALL write_data(num, 'A') [L59] COND FALSE !(i___0 == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, c=65, data_0=65, data_1=0, e=0, i=1, i___0=1, max_loop=2, num=1, timer=1] [L62] COND TRUE i___0 == 1 [L63] data_1 = c VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=1, timer=1] [L96] RET write_data(num, 'A') [L97] num += 1 [L98] P_1_pc = 1 [L99] P_1_st = 2 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L296] RET P_1() [L304] COND FALSE !((int )C_1_st == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L279] COND TRUE 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L251] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L254] COND FALSE !((int )P_1_st == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L258] COND FALSE !((int )C_1_st == 0) [L266] __retres1 = 0 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, __retres1=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L268] return (__retres1); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \result=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L282] tmp___2 = exists_runnable_thread() [L284] COND FALSE !(\read(tmp___2)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L449] RET eval() [L452] kernel_st = 2 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L453] FCALL update_channels() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L456] kernel_st = 3 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L457] FCALL fire_delta_events() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L458] CALL activate_threads() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L375] int tmp ; [L376] int tmp___0 ; [L377] int tmp___1 ; [L381] CALL, EXPR is_P_1_triggered() [L114] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L117] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L118] COND FALSE !((int )P_1_ev == 1) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L127] __retres1 = 0 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, __retres1=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L129] return (__retres1); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, \result=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L381] RET, EXPR is_P_1_triggered() [L381] tmp = is_P_1_triggered() [L383] COND FALSE !(\read(tmp)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L389] CALL, EXPR is_C_1_triggered() [L196] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L199] COND TRUE (int )C_1_pc == 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L200] COND FALSE !((int )e == 1) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L209] COND FALSE !((int )C_1_pc == 2) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L219] __retres1 = 0 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, __retres1=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L221] return (__retres1); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, \result=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L389] RET, EXPR is_C_1_triggered() [L389] tmp___1 = is_C_1_triggered() [L391] COND FALSE !(\read(tmp___1)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L458] RET activate_threads() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L459] FCALL reset_delta_events() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L462] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L251] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L254] COND FALSE !((int )P_1_st == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L258] COND FALSE !((int )C_1_st == 0) [L266] __retres1 = 0 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, __retres1=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L268] return (__retres1); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \result=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L462] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L462] tmp = exists_runnable_thread() [L464] COND TRUE tmp == 0 [L466] kernel_st = 4 [L467] CALL fire_time_events() [L346] C_1_ev = 1 [L348] P_1_ev = 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L467] RET fire_time_events() [L468] CALL activate_threads() VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L375] int tmp ; [L376] int tmp___0 ; [L377] int tmp___1 ; [L381] CALL, EXPR is_P_1_triggered() [L114] int __retres1 ; VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L117] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L118] COND TRUE (int )P_1_ev == 1 [L119] __retres1 = 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, __retres1=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L129] return (__retres1); VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, \result=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L381] RET, EXPR is_P_1_triggered() [L381] tmp = is_P_1_triggered() [L383] COND TRUE \read(tmp) [L384] P_1_st = 0 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L389] CALL, EXPR is_C_1_triggered() [L196] int __retres1 ; VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L199] COND TRUE (int )C_1_pc == 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L200] COND FALSE !((int )e == 1) VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L209] COND FALSE !((int )C_1_pc == 2) VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L219] __retres1 = 0 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, __retres1=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L221] return (__retres1); VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, \result=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L389] RET, EXPR is_C_1_triggered() [L389] tmp___1 = is_C_1_triggered() [L391] COND FALSE !(\read(tmp___1)) VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L468] RET activate_threads() VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L469] CALL reset_time_events() [L360] COND TRUE (int )P_1_ev == 1 [L361] P_1_ev = 2 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L365] COND TRUE (int )C_1_ev == 1 [L366] C_1_ev = 2 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L469] RET reset_time_events() [L475] CALL, EXPR stop_simulation() [L412] int tmp ; [L413] int __retres2 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L417] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L251] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, __retres1=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L268] return (__retres1); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, \result=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L417] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L417] tmp = exists_runnable_thread() [L419] COND TRUE \read(tmp) [L420] __retres2 = 0 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, __retres2=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L427] return (__retres2); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, \result=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L475] RET, EXPR stop_simulation() [L475] tmp___0 = stop_simulation() [L477] COND FALSE !(\read(tmp___0)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L445] COND TRUE 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L448] kernel_st = 1 [L449] CALL eval() [L272] int tmp ; [L273] int tmp___0 ; [L274] int tmp___1 ; [L275] int tmp___2 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L279] COND TRUE 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L251] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, __retres1=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L268] return (__retres1); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, \result=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L282] tmp___2 = exists_runnable_thread() [L284] COND TRUE \read(tmp___2) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L289] COND TRUE (int )P_1_st == 0 [L291] tmp = __VERIFIER_nondet_int() [L293] COND TRUE \read(tmp) [L295] P_1_st = 1 [L296] CALL P_1() [L82] COND FALSE !((int )P_1_pc == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L85] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L93] COND TRUE i < max_loop VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L96] CALL write_data(num, 'A') [L59] COND FALSE !(i___0 == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, c=65, data_0=65, data_1=65, e=0, i=1, i___0=2, max_loop=2, num=2, timer=1] [L62] COND FALSE !(i___0 == 1) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, c=65, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L66] CALL error() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L19] reach_error() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 108 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.6s, OverallIterations: 26, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4296 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4187 mSDsluCounter, 11344 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6878 mSDsCounter, 577 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2409 IncrementalHoareTripleChecker+Invalid, 2986 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 577 mSolverCounterUnsat, 4466 mSDtfsCounter, 2409 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2861 GetRequests, 2721 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8718occurred in iteration=15, InterpolantAutomatonStates: 139, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.9s AutomataMinimizationTime, 25 MinimizatonAttempts, 2626 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 5201 NumberOfCodeBlocks, 5201 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 5059 ConstructedInterpolants, 0 QuantifiedInterpolants, 8431 SizeOfPredicates, 1 NumberOfNonLiveVariables, 5367 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 38 InterpolantComputations, 24 PerfectInterpolantSequences, 4307/4568 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-11-11 21:07:12,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE