./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/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())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '06f1e7cb4ad4b39445b3c30d820384fbedafa8e52cac3d3c0cb4d178fb229699'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 06f1e7cb4ad4b39445b3c30d820384fbedafa8e52cac3d3c0cb4d178fb229699 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 00:33:36,273 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 00:33:36,331 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 00:33:36,338 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 00:33:36,342 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 00:33:36,356 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 00:33:36,357 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 00:33:36,357 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 00:33:36,357 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 00:33:36,357 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 00:33:36,361 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 00:33:36,361 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 00:33:36,361 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 00:33:36,361 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 00:33:36,362 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 00:33:36,362 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 00:33:36,362 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 00:33:36,362 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 00:33:36,362 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 00:33:36,362 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 00:33:36,362 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 00:33:36,362 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 00:33:36,362 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 00:33:36,362 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 00:33:36,362 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 00:33:36,362 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 00:33:36,362 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 00:33:36,362 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 00:33:36,362 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 00:33:36,362 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 00:33:36,362 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 00:33:36,362 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 00:33:36,363 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:33:36,363 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 00:33:36,363 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 00:33:36,363 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 00:33:36,363 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 00:33:36,363 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 00:33:36,363 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 00:33:36,363 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 00:33:36,363 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 00:33:36,363 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 00:33:36,363 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> 06f1e7cb4ad4b39445b3c30d820384fbedafa8e52cac3d3c0cb4d178fb229699 [2024-11-07 00:33:36,608 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 00:33:36,615 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 00:33:36,617 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 00:33:36,618 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 00:33:36,618 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 00:33:36,620 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c [2024-11-07 00:33:37,831 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 00:33:38,041 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 00:33:38,042 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c [2024-11-07 00:33:38,051 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c0424f8dd/4150343eabe847059cdb568ec8977a14/FLAG102783149 [2024-11-07 00:33:38,067 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c0424f8dd/4150343eabe847059cdb568ec8977a14 [2024-11-07 00:33:38,069 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 00:33:38,071 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 00:33:38,072 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 00:33:38,073 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 00:33:38,076 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 00:33:38,076 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:33:38" (1/1) ... [2024-11-07 00:33:38,077 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@685f6811 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:33:38, skipping insertion in model container [2024-11-07 00:33:38,077 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:33:38" (1/1) ... [2024-11-07 00:33:38,114 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 00:33:38,317 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c[11714,11727] [2024-11-07 00:33:38,358 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:33:38,373 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 00:33:38,441 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c[11714,11727] [2024-11-07 00:33:38,481 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:33:38,499 INFO L204 MainTranslator]: Completed translation [2024-11-07 00:33:38,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:33:38 WrapperNode [2024-11-07 00:33:38,500 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 00:33:38,501 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 00:33:38,502 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 00:33:38,502 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 00:33:38,506 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:33:38" (1/1) ... [2024-11-07 00:33:38,520 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:33:38" (1/1) ... [2024-11-07 00:33:38,557 INFO L138 Inliner]: procedures = 26, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1037 [2024-11-07 00:33:38,557 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 00:33:38,558 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 00:33:38,558 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 00:33:38,558 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 00:33:38,564 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:33:38" (1/1) ... [2024-11-07 00:33:38,565 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:33:38" (1/1) ... [2024-11-07 00:33:38,567 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:33:38" (1/1) ... [2024-11-07 00:33:38,582 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-07 00:33:38,582 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:33:38" (1/1) ... [2024-11-07 00:33:38,582 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:33:38" (1/1) ... [2024-11-07 00:33:38,589 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:33:38" (1/1) ... [2024-11-07 00:33:38,594 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:33:38" (1/1) ... [2024-11-07 00:33:38,596 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:33:38" (1/1) ... [2024-11-07 00:33:38,597 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:33:38" (1/1) ... [2024-11-07 00:33:38,604 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 00:33:38,605 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 00:33:38,605 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 00:33:38,605 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 00:33:38,606 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:33:38" (1/1) ... [2024-11-07 00:33:38,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:33:38,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:33:38,631 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 00:33:38,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 00:33:38,656 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 00:33:38,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 00:33:38,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 00:33:38,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 00:33:38,775 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 00:33:38,776 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 00:33:39,434 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-11-07 00:33:39,435 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 00:33:39,450 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 00:33:39,450 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-07 00:33:39,450 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:33:39 BoogieIcfgContainer [2024-11-07 00:33:39,450 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 00:33:39,452 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 00:33:39,452 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 00:33:39,455 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 00:33:39,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:33:38" (1/3) ... [2024-11-07 00:33:39,456 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f53961e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:33:39, skipping insertion in model container [2024-11-07 00:33:39,456 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:33:38" (2/3) ... [2024-11-07 00:33:39,456 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f53961e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:33:39, skipping insertion in model container [2024-11-07 00:33:39,456 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:33:39" (3/3) ... [2024-11-07 00:33:39,457 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.1.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c [2024-11-07 00:33:39,466 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 00:33:39,466 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 00:33:39,504 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 00:33:39,511 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;@526514e2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 00:33:39,511 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 00:33:39,517 INFO L276 IsEmpty]: Start isEmpty. Operand has 257 states, 255 states have (on average 1.6705882352941177) internal successors, (426), 256 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:39,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 00:33:39,524 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:33:39,524 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 00:33:39,525 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:33:39,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:33:39,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1061563800, now seen corresponding path program 1 times [2024-11-07 00:33:39,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:33:39,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078928073] [2024-11-07 00:33:39,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:33:39,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:33:39,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:33:39,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:33:39,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:33:39,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078928073] [2024-11-07 00:33:39,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078928073] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:33:39,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:33:39,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:33:39,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309742447] [2024-11-07 00:33:39,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:33:39,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:33:39,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:33:39,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:33:39,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:33:39,932 INFO L87 Difference]: Start difference. First operand has 257 states, 255 states have (on average 1.6705882352941177) internal successors, (426), 256 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:40,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:33:40,030 INFO L93 Difference]: Finished difference Result 472 states and 770 transitions. [2024-11-07 00:33:40,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:33:40,031 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2024-11-07 00:33:40,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:33:40,040 INFO L225 Difference]: With dead ends: 472 [2024-11-07 00:33:40,040 INFO L226 Difference]: Without dead ends: 254 [2024-11-07 00:33:40,043 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-07 00:33:40,046 INFO L432 NwaCegarLoop]: 423 mSDtfsCounter, 0 mSDsluCounter, 800 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1223 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:33:40,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1223 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:33:40,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-11-07 00:33:40,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2024-11-07 00:33:40,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 253 states have (on average 1.5019762845849802) internal successors, (380), 253 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:40,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 380 transitions. [2024-11-07 00:33:40,082 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 380 transitions. Word has length 91 [2024-11-07 00:33:40,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:33:40,082 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 380 transitions. [2024-11-07 00:33:40,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:40,083 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 380 transitions. [2024-11-07 00:33:40,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-07 00:33:40,085 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:33:40,086 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 00:33:40,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 00:33:40,086 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:33:40,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:33:40,087 INFO L85 PathProgramCache]: Analyzing trace with hash 580651905, now seen corresponding path program 1 times [2024-11-07 00:33:40,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:33:40,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888516914] [2024-11-07 00:33:40,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:33:40,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:33:40,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:33:40,260 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-07 00:33:40,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:33:40,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888516914] [2024-11-07 00:33:40,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888516914] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:33:40,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:33:40,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:33:40,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500718915] [2024-11-07 00:33:40,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:33:40,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:33:40,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:33:40,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:33:40,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:33:40,262 INFO L87 Difference]: Start difference. First operand 254 states and 380 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:40,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:33:40,308 INFO L93 Difference]: Finished difference Result 555 states and 860 transitions. [2024-11-07 00:33:40,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:33:40,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 130 [2024-11-07 00:33:40,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:33:40,311 INFO L225 Difference]: With dead ends: 555 [2024-11-07 00:33:40,311 INFO L226 Difference]: Without dead ends: 362 [2024-11-07 00:33:40,311 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:33:40,312 INFO L432 NwaCegarLoop]: 370 mSDtfsCounter, 207 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:33:40,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 662 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:33:40,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2024-11-07 00:33:40,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 360. [2024-11-07 00:33:40,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 359 states have (on average 1.5264623955431755) internal successors, (548), 359 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:40,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 548 transitions. [2024-11-07 00:33:40,325 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 548 transitions. Word has length 130 [2024-11-07 00:33:40,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:33:40,325 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 548 transitions. [2024-11-07 00:33:40,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:40,325 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 548 transitions. [2024-11-07 00:33:40,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-07 00:33:40,328 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:33:40,329 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 00:33:40,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 00:33:40,329 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:33:40,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:33:40,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1531216486, now seen corresponding path program 1 times [2024-11-07 00:33:40,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:33:40,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768490548] [2024-11-07 00:33:40,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:33:40,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:33:40,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:33:40,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-07 00:33:40,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:33:40,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768490548] [2024-11-07 00:33:40,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768490548] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:33:40,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:33:40,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:33:40,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709811798] [2024-11-07 00:33:40,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:33:40,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:33:40,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:33:40,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:33:40,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:33:40,460 INFO L87 Difference]: Start difference. First operand 360 states and 548 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:40,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:33:40,488 INFO L93 Difference]: Finished difference Result 843 states and 1319 transitions. [2024-11-07 00:33:40,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:33:40,489 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 132 [2024-11-07 00:33:40,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:33:40,491 INFO L225 Difference]: With dead ends: 843 [2024-11-07 00:33:40,491 INFO L226 Difference]: Without dead ends: 550 [2024-11-07 00:33:40,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:33:40,492 INFO L432 NwaCegarLoop]: 425 mSDtfsCounter, 194 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:33:40,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 705 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:33:40,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2024-11-07 00:33:40,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 548. [2024-11-07 00:33:40,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 547 states have (on average 1.546617915904936) internal successors, (846), 547 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:40,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 846 transitions. [2024-11-07 00:33:40,511 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 846 transitions. Word has length 132 [2024-11-07 00:33:40,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:33:40,512 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 846 transitions. [2024-11-07 00:33:40,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:40,512 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 846 transitions. [2024-11-07 00:33:40,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 00:33:40,514 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:33:40,514 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 00:33:40,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 00:33:40,515 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:33:40,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:33:40,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1634279726, now seen corresponding path program 1 times [2024-11-07 00:33:40,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:33:40,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497018691] [2024-11-07 00:33:40,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:33:40,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:33:40,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:33:40,640 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-07 00:33:40,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:33:40,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497018691] [2024-11-07 00:33:40,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497018691] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:33:40,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:33:40,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:33:40,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199579147] [2024-11-07 00:33:40,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:33:40,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:33:40,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:33:40,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:33:40,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:33:40,641 INFO L87 Difference]: Start difference. First operand 548 states and 846 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:40,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:33:40,689 INFO L93 Difference]: Finished difference Result 1349 states and 2123 transitions. [2024-11-07 00:33:40,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:33:40,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2024-11-07 00:33:40,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:33:40,694 INFO L225 Difference]: With dead ends: 1349 [2024-11-07 00:33:40,694 INFO L226 Difference]: Without dead ends: 874 [2024-11-07 00:33:40,695 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:33:40,696 INFO L432 NwaCegarLoop]: 401 mSDtfsCounter, 181 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:33:40,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 669 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:33:40,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2024-11-07 00:33:40,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 872. [2024-11-07 00:33:40,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 871 states have (on average 1.5591274397244546) internal successors, (1358), 871 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:40,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1358 transitions. [2024-11-07 00:33:40,739 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1358 transitions. Word has length 134 [2024-11-07 00:33:40,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:33:40,740 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1358 transitions. [2024-11-07 00:33:40,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:40,740 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1358 transitions. [2024-11-07 00:33:40,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-07 00:33:40,742 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:33:40,742 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 00:33:40,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 00:33:40,742 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:33:40,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:33:40,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1057437148, now seen corresponding path program 1 times [2024-11-07 00:33:40,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:33:40,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114217162] [2024-11-07 00:33:40,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:33:40,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:33:40,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:33:40,854 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-07 00:33:40,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:33:40,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114217162] [2024-11-07 00:33:40,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114217162] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:33:40,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:33:40,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:33:40,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674005255] [2024-11-07 00:33:40,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:33:40,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:33:40,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:33:40,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:33:40,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:33:40,857 INFO L87 Difference]: Start difference. First operand 872 states and 1358 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:40,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:33:40,890 INFO L93 Difference]: Finished difference Result 2207 states and 3479 transitions. [2024-11-07 00:33:40,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:33:40,891 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 136 [2024-11-07 00:33:40,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:33:40,897 INFO L225 Difference]: With dead ends: 2207 [2024-11-07 00:33:40,897 INFO L226 Difference]: Without dead ends: 1414 [2024-11-07 00:33:40,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:33:40,900 INFO L432 NwaCegarLoop]: 346 mSDtfsCounter, 168 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:33:40,901 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 602 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:33:40,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2024-11-07 00:33:40,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 1412. [2024-11-07 00:33:40,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1412 states, 1411 states have (on average 1.56343019135365) internal successors, (2206), 1411 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:40,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 2206 transitions. [2024-11-07 00:33:40,942 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 2206 transitions. Word has length 136 [2024-11-07 00:33:40,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:33:40,942 INFO L471 AbstractCegarLoop]: Abstraction has 1412 states and 2206 transitions. [2024-11-07 00:33:40,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:40,942 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 2206 transitions. [2024-11-07 00:33:40,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-07 00:33:40,947 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:33:40,948 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 00:33:40,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 00:33:40,948 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:33:40,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:33:40,948 INFO L85 PathProgramCache]: Analyzing trace with hash -518774298, now seen corresponding path program 1 times [2024-11-07 00:33:40,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:33:40,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017903525] [2024-11-07 00:33:40,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:33:40,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:33:40,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:33:41,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:33:41,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:33:41,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017903525] [2024-11-07 00:33:41,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017903525] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:33:41,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:33:41,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:33:41,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042572130] [2024-11-07 00:33:41,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:33:41,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:33:41,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:33:41,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:33:41,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:33:41,065 INFO L87 Difference]: Start difference. First operand 1412 states and 2206 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:41,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:33:41,109 INFO L93 Difference]: Finished difference Result 3601 states and 5663 transitions. [2024-11-07 00:33:41,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:33:41,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 138 [2024-11-07 00:33:41,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:33:41,118 INFO L225 Difference]: With dead ends: 3601 [2024-11-07 00:33:41,119 INFO L226 Difference]: Without dead ends: 2274 [2024-11-07 00:33:41,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:33:41,123 INFO L432 NwaCegarLoop]: 338 mSDtfsCounter, 155 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:33:41,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 582 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:33:41,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2274 states. [2024-11-07 00:33:41,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2274 to 2272. [2024-11-07 00:33:41,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2272 states, 2271 states have (on average 1.5596653456627037) internal successors, (3542), 2271 states have internal predecessors, (3542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:41,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2272 states to 2272 states and 3542 transitions. [2024-11-07 00:33:41,177 INFO L78 Accepts]: Start accepts. Automaton has 2272 states and 3542 transitions. Word has length 138 [2024-11-07 00:33:41,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:33:41,180 INFO L471 AbstractCegarLoop]: Abstraction has 2272 states and 3542 transitions. [2024-11-07 00:33:41,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:41,180 INFO L276 IsEmpty]: Start isEmpty. Operand 2272 states and 3542 transitions. [2024-11-07 00:33:41,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-07 00:33:41,185 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:33:41,186 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 00:33:41,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 00:33:41,186 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:33:41,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:33:41,186 INFO L85 PathProgramCache]: Analyzing trace with hash -300312724, now seen corresponding path program 1 times [2024-11-07 00:33:41,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:33:41,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815962323] [2024-11-07 00:33:41,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:33:41,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:33:41,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:33:41,428 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-07 00:33:41,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:33:41,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815962323] [2024-11-07 00:33:41,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815962323] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:33:41,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:33:41,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:33:41,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723410000] [2024-11-07 00:33:41,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:33:41,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 00:33:41,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:33:41,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 00:33:41,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:33:41,432 INFO L87 Difference]: Start difference. First operand 2272 states and 3542 transitions. Second operand has 8 states, 8 states have (on average 17.5) internal successors, (140), 8 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:42,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:33:42,000 INFO L93 Difference]: Finished difference Result 24689 states and 38597 transitions. [2024-11-07 00:33:42,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 00:33:42,001 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 17.5) internal successors, (140), 8 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 140 [2024-11-07 00:33:42,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:33:42,078 INFO L225 Difference]: With dead ends: 24689 [2024-11-07 00:33:42,078 INFO L226 Difference]: Without dead ends: 22508 [2024-11-07 00:33:42,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2024-11-07 00:33:42,084 INFO L432 NwaCegarLoop]: 631 mSDtfsCounter, 2801 mSDsluCounter, 4660 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2801 SdHoareTripleChecker+Valid, 5291 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 00:33:42,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2801 Valid, 5291 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 00:33:42,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22508 states. [2024-11-07 00:33:42,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22508 to 4488. [2024-11-07 00:33:42,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4488 states, 4487 states have (on average 1.53599286828616) internal successors, (6892), 4487 states have internal predecessors, (6892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:42,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4488 states to 4488 states and 6892 transitions. [2024-11-07 00:33:42,274 INFO L78 Accepts]: Start accepts. Automaton has 4488 states and 6892 transitions. Word has length 140 [2024-11-07 00:33:42,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:33:42,274 INFO L471 AbstractCegarLoop]: Abstraction has 4488 states and 6892 transitions. [2024-11-07 00:33:42,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.5) internal successors, (140), 8 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:42,275 INFO L276 IsEmpty]: Start isEmpty. Operand 4488 states and 6892 transitions. [2024-11-07 00:33:42,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-07 00:33:42,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:33:42,321 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 00:33:42,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 00:33:42,321 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:33:42,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:33:42,322 INFO L85 PathProgramCache]: Analyzing trace with hash 2107826276, now seen corresponding path program 1 times [2024-11-07 00:33:42,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:33:42,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315605204] [2024-11-07 00:33:42,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:33:42,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:33:42,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:33:42,404 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-07 00:33:42,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:33:42,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315605204] [2024-11-07 00:33:42,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315605204] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:33:42,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:33:42,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:33:42,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9003514] [2024-11-07 00:33:42,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:33:42,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:33:42,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:33:42,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:33:42,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:33:42,406 INFO L87 Difference]: Start difference. First operand 4488 states and 6892 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:42,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:33:42,462 INFO L93 Difference]: Finished difference Result 12513 states and 19228 transitions. [2024-11-07 00:33:42,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:33:42,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143 [2024-11-07 00:33:42,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:33:42,475 INFO L225 Difference]: With dead ends: 12513 [2024-11-07 00:33:42,475 INFO L226 Difference]: Without dead ends: 8074 [2024-11-07 00:33:42,481 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:33:42,482 INFO L432 NwaCegarLoop]: 515 mSDtfsCounter, 205 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:33:42,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 777 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:33:42,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8074 states. [2024-11-07 00:33:42,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8074 to 8072. [2024-11-07 00:33:42,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8072 states, 8071 states have (on average 1.5267005327716516) internal successors, (12322), 8071 states have internal predecessors, (12322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:42,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8072 states to 8072 states and 12322 transitions. [2024-11-07 00:33:42,652 INFO L78 Accepts]: Start accepts. Automaton has 8072 states and 12322 transitions. Word has length 143 [2024-11-07 00:33:42,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:33:42,652 INFO L471 AbstractCegarLoop]: Abstraction has 8072 states and 12322 transitions. [2024-11-07 00:33:42,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:42,653 INFO L276 IsEmpty]: Start isEmpty. Operand 8072 states and 12322 transitions. [2024-11-07 00:33:42,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-07 00:33:42,666 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:33:42,666 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 00:33:42,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 00:33:42,666 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:33:42,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:33:42,667 INFO L85 PathProgramCache]: Analyzing trace with hash -2102558318, now seen corresponding path program 1 times [2024-11-07 00:33:42,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:33:42,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54989544] [2024-11-07 00:33:42,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:33:42,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:33:42,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:33:42,800 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-07 00:33:42,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:33:42,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54989544] [2024-11-07 00:33:42,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54989544] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:33:42,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:33:42,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:33:42,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872320199] [2024-11-07 00:33:42,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:33:42,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:33:42,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:33:42,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:33:42,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:33:42,803 INFO L87 Difference]: Start difference. First operand 8072 states and 12322 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:42,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:33:42,885 INFO L93 Difference]: Finished difference Result 18816 states and 28711 transitions. [2024-11-07 00:33:42,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:33:42,885 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 144 [2024-11-07 00:33:42,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:33:42,901 INFO L225 Difference]: With dead ends: 18816 [2024-11-07 00:33:42,901 INFO L226 Difference]: Without dead ends: 10827 [2024-11-07 00:33:42,912 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:33:42,913 INFO L432 NwaCegarLoop]: 313 mSDtfsCounter, 223 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:33:42,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 516 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:33:42,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10827 states. [2024-11-07 00:33:43,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10827 to 10761. [2024-11-07 00:33:43,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10761 states, 10760 states have (on average 1.5021375464684015) internal successors, (16163), 10760 states have internal predecessors, (16163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:43,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10761 states to 10761 states and 16163 transitions. [2024-11-07 00:33:43,113 INFO L78 Accepts]: Start accepts. Automaton has 10761 states and 16163 transitions. Word has length 144 [2024-11-07 00:33:43,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:33:43,113 INFO L471 AbstractCegarLoop]: Abstraction has 10761 states and 16163 transitions. [2024-11-07 00:33:43,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:43,113 INFO L276 IsEmpty]: Start isEmpty. Operand 10761 states and 16163 transitions. [2024-11-07 00:33:43,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-07 00:33:43,127 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:33:43,128 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 00:33:43,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 00:33:43,128 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:33:43,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:33:43,129 INFO L85 PathProgramCache]: Analyzing trace with hash 840792049, now seen corresponding path program 1 times [2024-11-07 00:33:43,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:33:43,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282485594] [2024-11-07 00:33:43,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:33:43,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:33:43,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:33:43,509 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-07 00:33:43,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:33:43,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282485594] [2024-11-07 00:33:43,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282485594] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:33:43,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:33:43,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:33:43,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764977696] [2024-11-07 00:33:43,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:33:43,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 00:33:43,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:33:43,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 00:33:43,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:33:43,511 INFO L87 Difference]: Start difference. First operand 10761 states and 16163 transitions. Second operand has 8 states, 8 states have (on average 18.0) internal successors, (144), 8 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:43,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:33:43,811 INFO L93 Difference]: Finished difference Result 21440 states and 32230 transitions. [2024-11-07 00:33:43,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 00:33:43,815 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 18.0) internal successors, (144), 8 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 144 [2024-11-07 00:33:43,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:33:43,833 INFO L225 Difference]: With dead ends: 21440 [2024-11-07 00:33:43,833 INFO L226 Difference]: Without dead ends: 10763 [2024-11-07 00:33:43,843 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2024-11-07 00:33:43,846 INFO L432 NwaCegarLoop]: 421 mSDtfsCounter, 1402 mSDsluCounter, 968 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1402 SdHoareTripleChecker+Valid, 1389 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:33:43,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1402 Valid, 1389 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:33:43,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10763 states. [2024-11-07 00:33:43,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10763 to 10761. [2024-11-07 00:33:43,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10761 states, 10760 states have (on average 1.4871747211895912) internal successors, (16002), 10760 states have internal predecessors, (16002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:44,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10761 states to 10761 states and 16002 transitions. [2024-11-07 00:33:44,001 INFO L78 Accepts]: Start accepts. Automaton has 10761 states and 16002 transitions. Word has length 144 [2024-11-07 00:33:44,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:33:44,001 INFO L471 AbstractCegarLoop]: Abstraction has 10761 states and 16002 transitions. [2024-11-07 00:33:44,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.0) internal successors, (144), 8 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:44,002 INFO L276 IsEmpty]: Start isEmpty. Operand 10761 states and 16002 transitions. [2024-11-07 00:33:44,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-07 00:33:44,015 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:33:44,015 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 00:33:44,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 00:33:44,015 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:33:44,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:33:44,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1097885333, now seen corresponding path program 1 times [2024-11-07 00:33:44,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:33:44,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185806096] [2024-11-07 00:33:44,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:33:44,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:33:44,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:33:44,086 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-07 00:33:44,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:33:44,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185806096] [2024-11-07 00:33:44,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185806096] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:33:44,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:33:44,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:33:44,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446341593] [2024-11-07 00:33:44,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:33:44,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:33:44,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:33:44,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:33:44,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:33:44,087 INFO L87 Difference]: Start difference. First operand 10761 states and 16002 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:44,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:33:44,317 INFO L93 Difference]: Finished difference Result 30880 states and 45859 transitions. [2024-11-07 00:33:44,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:33:44,317 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 145 [2024-11-07 00:33:44,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:33:44,395 INFO L225 Difference]: With dead ends: 30880 [2024-11-07 00:33:44,395 INFO L226 Difference]: Without dead ends: 21346 [2024-11-07 00:33:44,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:33:44,403 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 228 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:33:44,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 390 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 00:33:44,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21346 states. [2024-11-07 00:33:44,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21346 to 21344. [2024-11-07 00:33:44,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21344 states, 21343 states have (on average 1.4790329381998781) internal successors, (31567), 21343 states have internal predecessors, (31567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:44,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21344 states to 21344 states and 31567 transitions. [2024-11-07 00:33:44,716 INFO L78 Accepts]: Start accepts. Automaton has 21344 states and 31567 transitions. Word has length 145 [2024-11-07 00:33:44,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:33:44,717 INFO L471 AbstractCegarLoop]: Abstraction has 21344 states and 31567 transitions. [2024-11-07 00:33:44,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:44,717 INFO L276 IsEmpty]: Start isEmpty. Operand 21344 states and 31567 transitions. [2024-11-07 00:33:44,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-07 00:33:44,749 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:33:44,750 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 00:33:44,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 00:33:44,750 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:33:44,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:33:44,750 INFO L85 PathProgramCache]: Analyzing trace with hash -501752442, now seen corresponding path program 1 times [2024-11-07 00:33:44,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:33:44,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286449742] [2024-11-07 00:33:44,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:33:44,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:33:44,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:33:44,831 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-07 00:33:44,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:33:44,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286449742] [2024-11-07 00:33:44,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286449742] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:33:44,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:33:44,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:33:44,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905149399] [2024-11-07 00:33:44,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:33:44,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:33:44,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:33:44,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:33:44,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:33:44,833 INFO L87 Difference]: Start difference. First operand 21344 states and 31567 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:45,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:33:45,140 INFO L93 Difference]: Finished difference Result 61449 states and 90838 transitions. [2024-11-07 00:33:45,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:33:45,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 145 [2024-11-07 00:33:45,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:33:45,209 INFO L225 Difference]: With dead ends: 61449 [2024-11-07 00:33:45,210 INFO L226 Difference]: Without dead ends: 42431 [2024-11-07 00:33:45,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:33:45,236 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 228 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:33:45,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 394 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 00:33:45,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42431 states. [2024-11-07 00:33:45,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42431 to 42429. [2024-11-07 00:33:45,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42429 states, 42428 states have (on average 1.4724710097105684) internal successors, (62474), 42428 states have internal predecessors, (62474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:45,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42429 states to 42429 states and 62474 transitions. [2024-11-07 00:33:45,830 INFO L78 Accepts]: Start accepts. Automaton has 42429 states and 62474 transitions. Word has length 145 [2024-11-07 00:33:45,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:33:45,831 INFO L471 AbstractCegarLoop]: Abstraction has 42429 states and 62474 transitions. [2024-11-07 00:33:45,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:45,831 INFO L276 IsEmpty]: Start isEmpty. Operand 42429 states and 62474 transitions. [2024-11-07 00:33:45,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-07 00:33:45,867 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:33:45,867 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 00:33:45,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 00:33:45,867 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:33:45,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:33:45,868 INFO L85 PathProgramCache]: Analyzing trace with hash -591821183, now seen corresponding path program 1 times [2024-11-07 00:33:45,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:33:45,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781347926] [2024-11-07 00:33:45,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:33:45,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:33:45,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:33:46,182 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-07 00:33:46,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:33:46,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781347926] [2024-11-07 00:33:46,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781347926] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:33:46,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:33:46,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:33:46,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230154592] [2024-11-07 00:33:46,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:33:46,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 00:33:46,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:33:46,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 00:33:46,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:33:46,184 INFO L87 Difference]: Start difference. First operand 42429 states and 62474 transitions. Second operand has 8 states, 8 states have (on average 18.125) internal successors, (145), 8 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:47,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:33:47,003 INFO L93 Difference]: Finished difference Result 260647 states and 383605 transitions. [2024-11-07 00:33:47,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 00:33:47,004 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 18.125) internal successors, (145), 8 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 145 [2024-11-07 00:33:47,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:33:47,380 INFO L225 Difference]: With dead ends: 260647 [2024-11-07 00:33:47,382 INFO L226 Difference]: Without dead ends: 226661 [2024-11-07 00:33:47,455 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-07 00:33:47,455 INFO L432 NwaCegarLoop]: 658 mSDtfsCounter, 2245 mSDsluCounter, 1385 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2245 SdHoareTripleChecker+Valid, 2043 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:33:47,456 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2245 Valid, 2043 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:33:47,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226661 states. [2024-11-07 00:33:49,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226661 to 78925. [2024-11-07 00:33:49,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78925 states, 78924 states have (on average 1.4650296487760377) internal successors, (115626), 78924 states have internal predecessors, (115626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:49,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78925 states to 78925 states and 115626 transitions. [2024-11-07 00:33:49,661 INFO L78 Accepts]: Start accepts. Automaton has 78925 states and 115626 transitions. Word has length 145 [2024-11-07 00:33:49,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:33:49,662 INFO L471 AbstractCegarLoop]: Abstraction has 78925 states and 115626 transitions. [2024-11-07 00:33:49,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.125) internal successors, (145), 8 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:49,662 INFO L276 IsEmpty]: Start isEmpty. Operand 78925 states and 115626 transitions. [2024-11-07 00:33:49,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-07 00:33:49,718 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:33:49,718 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 00:33:49,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 00:33:49,719 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:33:49,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:33:49,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1386087233, now seen corresponding path program 1 times [2024-11-07 00:33:49,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:33:49,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841169457] [2024-11-07 00:33:49,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:33:49,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:33:49,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:33:50,091 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-07 00:33:50,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:33:50,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841169457] [2024-11-07 00:33:50,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841169457] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:33:50,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:33:50,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:33:50,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946612248] [2024-11-07 00:33:50,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:33:50,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 00:33:50,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:33:50,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 00:33:50,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:33:50,093 INFO L87 Difference]: Start difference. First operand 78925 states and 115626 transitions. Second operand has 8 states, 8 states have (on average 18.125) internal successors, (145), 8 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:51,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:33:51,342 INFO L93 Difference]: Finished difference Result 296239 states and 435517 transitions. [2024-11-07 00:33:51,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 00:33:51,342 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 18.125) internal successors, (145), 8 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 145 [2024-11-07 00:33:51,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:33:51,785 INFO L225 Difference]: With dead ends: 296239 [2024-11-07 00:33:51,785 INFO L226 Difference]: Without dead ends: 262253 [2024-11-07 00:33:51,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-07 00:33:51,870 INFO L432 NwaCegarLoop]: 534 mSDtfsCounter, 2367 mSDsluCounter, 1479 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2367 SdHoareTripleChecker+Valid, 2013 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:33:51,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2367 Valid, 2013 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:33:52,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262253 states. [2024-11-07 00:33:54,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262253 to 131461. [2024-11-07 00:33:54,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131461 states, 131460 states have (on average 1.4582838886353264) internal successors, (191706), 131460 states have internal predecessors, (191706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:54,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131461 states to 131461 states and 191706 transitions. [2024-11-07 00:33:54,740 INFO L78 Accepts]: Start accepts. Automaton has 131461 states and 191706 transitions. Word has length 145 [2024-11-07 00:33:54,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:33:54,741 INFO L471 AbstractCegarLoop]: Abstraction has 131461 states and 191706 transitions. [2024-11-07 00:33:54,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.125) internal successors, (145), 8 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:54,741 INFO L276 IsEmpty]: Start isEmpty. Operand 131461 states and 191706 transitions. [2024-11-07 00:33:54,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-07 00:33:54,811 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:33:54,811 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 00:33:54,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 00:33:54,811 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:33:54,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:33:54,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1229716121, now seen corresponding path program 1 times [2024-11-07 00:33:54,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:33:54,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167826858] [2024-11-07 00:33:54,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:33:54,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:33:54,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:33:54,983 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-07 00:33:54,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:33:54,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167826858] [2024-11-07 00:33:54,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167826858] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:33:54,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:33:54,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:33:54,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864168505] [2024-11-07 00:33:54,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:33:54,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 00:33:54,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:33:54,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 00:33:54,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:33:54,985 INFO L87 Difference]: Start difference. First operand 131461 states and 191706 transitions. Second operand has 8 states, 8 states have (on average 18.125) internal successors, (145), 8 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:55,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:33:55,998 INFO L93 Difference]: Finished difference Result 330703 states and 485725 transitions. [2024-11-07 00:33:55,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 00:33:55,999 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 18.125) internal successors, (145), 8 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 145 [2024-11-07 00:33:55,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:33:56,442 INFO L225 Difference]: With dead ends: 330703 [2024-11-07 00:33:56,443 INFO L226 Difference]: Without dead ends: 296717 [2024-11-07 00:33:56,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-07 00:33:56,538 INFO L432 NwaCegarLoop]: 554 mSDtfsCounter, 2145 mSDsluCounter, 1710 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2145 SdHoareTripleChecker+Valid, 2264 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:33:56,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2145 Valid, 2264 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 00:33:56,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296717 states. [2024-11-07 00:33:59,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296717 to 167161. [2024-11-07 00:33:59,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167161 states, 167160 states have (on average 1.4582316343622876) internal successors, (243758), 167160 states have internal predecessors, (243758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:59,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167161 states to 167161 states and 243758 transitions. [2024-11-07 00:33:59,841 INFO L78 Accepts]: Start accepts. Automaton has 167161 states and 243758 transitions. Word has length 145 [2024-11-07 00:33:59,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:33:59,842 INFO L471 AbstractCegarLoop]: Abstraction has 167161 states and 243758 transitions. [2024-11-07 00:33:59,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.125) internal successors, (145), 8 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:33:59,842 INFO L276 IsEmpty]: Start isEmpty. Operand 167161 states and 243758 transitions. [2024-11-07 00:34:00,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-07 00:34:00,007 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:34:00,007 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 00:34:00,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 00:34:00,007 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:34:00,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:34:00,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1299911355, now seen corresponding path program 1 times [2024-11-07 00:34:00,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:34:00,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910404883] [2024-11-07 00:34:00,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:34:00,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:34:00,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:34:00,221 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-07 00:34:00,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:34:00,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910404883] [2024-11-07 00:34:00,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910404883] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:34:00,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:34:00,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:34:00,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868653858] [2024-11-07 00:34:00,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:34:00,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 00:34:00,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:34:00,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 00:34:00,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:34:00,222 INFO L87 Difference]: Start difference. First operand 167161 states and 243758 transitions. Second operand has 8 states, 8 states have (on average 18.125) internal successors, (145), 8 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:34:01,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:34:01,506 INFO L93 Difference]: Finished difference Result 365823 states and 536909 transitions. [2024-11-07 00:34:01,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 00:34:01,507 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 18.125) internal successors, (145), 8 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 145 [2024-11-07 00:34:01,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:34:01,965 INFO L225 Difference]: With dead ends: 365823 [2024-11-07 00:34:01,969 INFO L226 Difference]: Without dead ends: 331837 [2024-11-07 00:34:02,048 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-07 00:34:02,049 INFO L432 NwaCegarLoop]: 571 mSDtfsCounter, 2144 mSDsluCounter, 1930 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2144 SdHoareTripleChecker+Valid, 2501 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 00:34:02,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2144 Valid, 2501 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 00:34:02,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331837 states. [2024-11-07 00:34:05,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331837 to 203113. [2024-11-07 00:34:05,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203113 states, 203112 states have (on average 1.4584564181338375) internal successors, (296230), 203112 states have internal predecessors, (296230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:34:05,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203113 states to 203113 states and 296230 transitions. [2024-11-07 00:34:05,972 INFO L78 Accepts]: Start accepts. Automaton has 203113 states and 296230 transitions. Word has length 145 [2024-11-07 00:34:05,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:34:05,976 INFO L471 AbstractCegarLoop]: Abstraction has 203113 states and 296230 transitions. [2024-11-07 00:34:05,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.125) internal successors, (145), 8 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:34:05,976 INFO L276 IsEmpty]: Start isEmpty. Operand 203113 states and 296230 transitions. [2024-11-07 00:34:06,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-07 00:34:06,138 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:34:06,138 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 00:34:06,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 00:34:06,138 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:34:06,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:34:06,139 INFO L85 PathProgramCache]: Analyzing trace with hash 589477583, now seen corresponding path program 1 times [2024-11-07 00:34:06,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:34:06,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128963518] [2024-11-07 00:34:06,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:34:06,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:34:06,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:34:06,333 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-07 00:34:06,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:34:06,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128963518] [2024-11-07 00:34:06,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128963518] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:34:06,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:34:06,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:34:06,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047021525] [2024-11-07 00:34:06,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:34:06,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 00:34:06,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:34:06,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 00:34:06,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:34:06,339 INFO L87 Difference]: Start difference. First operand 203113 states and 296230 transitions. Second operand has 8 states, 8 states have (on average 18.125) internal successors, (145), 8 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:34:07,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:34:07,866 INFO L93 Difference]: Finished difference Result 401723 states and 589305 transitions. [2024-11-07 00:34:07,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 00:34:07,867 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 18.125) internal successors, (145), 8 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 145 [2024-11-07 00:34:07,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:34:08,422 INFO L225 Difference]: With dead ends: 401723 [2024-11-07 00:34:08,423 INFO L226 Difference]: Without dead ends: 367737 [2024-11-07 00:34:08,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-07 00:34:08,520 INFO L432 NwaCegarLoop]: 510 mSDtfsCounter, 2331 mSDsluCounter, 2213 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2331 SdHoareTripleChecker+Valid, 2723 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:34:08,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2331 Valid, 2723 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 00:34:08,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367737 states. [2024-11-07 00:34:11,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367737 to 239209. [2024-11-07 00:34:11,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239209 states, 239208 states have (on average 1.4587388381659476) internal successors, (348942), 239208 states have internal predecessors, (348942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:34:12,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239209 states to 239209 states and 348942 transitions. [2024-11-07 00:34:12,824 INFO L78 Accepts]: Start accepts. Automaton has 239209 states and 348942 transitions. Word has length 145 [2024-11-07 00:34:12,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:34:12,824 INFO L471 AbstractCegarLoop]: Abstraction has 239209 states and 348942 transitions. [2024-11-07 00:34:12,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.125) internal successors, (145), 8 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:34:12,824 INFO L276 IsEmpty]: Start isEmpty. Operand 239209 states and 348942 transitions. [2024-11-07 00:34:13,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-07 00:34:13,097 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:34:13,097 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 00:34:13,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 00:34:13,097 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:34:13,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:34:13,098 INFO L85 PathProgramCache]: Analyzing trace with hash 82881477, now seen corresponding path program 1 times [2024-11-07 00:34:13,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:34:13,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003820592] [2024-11-07 00:34:13,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:34:13,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:34:13,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:34:13,323 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-07 00:34:13,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:34:13,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003820592] [2024-11-07 00:34:13,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003820592] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:34:13,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:34:13,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:34:13,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877899804] [2024-11-07 00:34:13,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:34:13,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 00:34:13,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:34:13,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 00:34:13,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:34:13,324 INFO L87 Difference]: Start difference. First operand 239209 states and 348942 transitions. Second operand has 8 states, 8 states have (on average 18.25) internal successors, (146), 8 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:34:15,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:34:15,001 INFO L93 Difference]: Finished difference Result 416111 states and 611077 transitions. [2024-11-07 00:34:15,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 00:34:15,002 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 18.25) internal successors, (146), 8 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 146 [2024-11-07 00:34:15,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:34:15,537 INFO L225 Difference]: With dead ends: 416111 [2024-11-07 00:34:15,537 INFO L226 Difference]: Without dead ends: 393069 [2024-11-07 00:34:15,603 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-07 00:34:15,604 INFO L432 NwaCegarLoop]: 513 mSDtfsCounter, 2348 mSDsluCounter, 1745 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2348 SdHoareTripleChecker+Valid, 2258 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:34:15,604 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2348 Valid, 2258 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 00:34:15,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393069 states. [2024-11-07 00:34:19,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393069 to 264541. [2024-11-07 00:34:19,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264541 states, 264540 states have (on average 1.4611098510622211) internal successors, (386522), 264540 states have internal predecessors, (386522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)