./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.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/pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.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', 'ed935744e0b15a55a11878fa4d21c1a0b8f1c4098e81aa4afd54cd8910ee834a'] 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/pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.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 ed935744e0b15a55a11878fa4d21c1a0b8f1c4098e81aa4afd54cd8910ee834a --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 00:09:34,192 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 00:09:34,269 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:09:34,275 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 00:09:34,276 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 00:09:34,296 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 00:09:34,297 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 00:09:34,298 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 00:09:34,298 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 00:09:34,298 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 00:09:34,298 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 00:09:34,298 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 00:09:34,299 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 00:09:34,299 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 00:09:34,299 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 00:09:34,299 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 00:09:34,299 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 00:09:34,299 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 00:09:34,300 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 00:09:34,300 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 00:09:34,300 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 00:09:34,300 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 00:09:34,300 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 00:09:34,300 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 00:09:34,300 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 00:09:34,300 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 00:09:34,301 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 00:09:34,301 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 00:09:34,301 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 00:09:34,301 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 00:09:34,301 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 00:09:34,301 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 00:09:34,301 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:09:34,301 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 00:09:34,301 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 00:09:34,302 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 00:09:34,302 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 00:09:34,302 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 00:09:34,302 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 00:09:34,302 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 00:09:34,302 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 00:09:34,302 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 00:09:34,302 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 -> ed935744e0b15a55a11878fa4d21c1a0b8f1c4098e81aa4afd54cd8910ee834a [2024-11-07 00:09:34,634 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 00:09:34,643 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 00:09:34,645 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 00:09:34,648 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 00:09:34,649 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 00:09:34,650 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c [2024-11-07 00:09:36,153 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 00:09:36,513 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 00:09:36,515 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c [2024-11-07 00:09:36,535 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c89439a6e/d232818b212a438dbd1a9e194f8836d0/FLAGfaad8378d [2024-11-07 00:09:36,559 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c89439a6e/d232818b212a438dbd1a9e194f8836d0 [2024-11-07 00:09:36,561 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 00:09:36,564 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 00:09:36,566 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 00:09:36,567 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 00:09:36,571 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 00:09:36,572 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:09:36" (1/1) ... [2024-11-07 00:09:36,573 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@437dc137 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:09:36, skipping insertion in model container [2024-11-07 00:09:36,575 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:09:36" (1/1) ... [2024-11-07 00:09:36,620 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 00:09:37,006 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/pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c[26792,26805] [2024-11-07 00:09:37,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:09:37,029 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 00:09:37,137 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/pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c[26792,26805] [2024-11-07 00:09:37,138 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:09:37,156 INFO L204 MainTranslator]: Completed translation [2024-11-07 00:09:37,157 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:09:37 WrapperNode [2024-11-07 00:09:37,158 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 00:09:37,159 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 00:09:37,160 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 00:09:37,160 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 00:09:37,167 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:09:37" (1/1) ... [2024-11-07 00:09:37,182 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:09:37" (1/1) ... [2024-11-07 00:09:37,253 INFO L138 Inliner]: procedures = 24, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 999 [2024-11-07 00:09:37,254 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 00:09:37,255 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 00:09:37,255 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 00:09:37,255 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 00:09:37,263 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:09:37" (1/1) ... [2024-11-07 00:09:37,263 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:09:37" (1/1) ... [2024-11-07 00:09:37,270 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:09:37" (1/1) ... [2024-11-07 00:09:37,308 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:09:37,308 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:09:37" (1/1) ... [2024-11-07 00:09:37,309 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:09:37" (1/1) ... [2024-11-07 00:09:37,330 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:09:37" (1/1) ... [2024-11-07 00:09:37,358 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:09:37" (1/1) ... [2024-11-07 00:09:37,367 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:09:37" (1/1) ... [2024-11-07 00:09:37,376 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:09:37" (1/1) ... [2024-11-07 00:09:37,390 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 00:09:37,392 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 00:09:37,392 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 00:09:37,392 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 00:09:37,393 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:09:37" (1/1) ... [2024-11-07 00:09:37,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:09:37,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:09:37,451 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:09:37,454 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:09:37,478 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 00:09:37,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 00:09:37,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 00:09:37,478 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 00:09:37,615 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 00:09:37,618 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 00:09:38,870 INFO L? ?]: Removed 103 outVars from TransFormulas that were not future-live. [2024-11-07 00:09:38,870 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 00:09:38,889 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 00:09:38,889 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 00:09:38,890 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:09:38 BoogieIcfgContainer [2024-11-07 00:09:38,890 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 00:09:38,893 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 00:09:38,893 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 00:09:38,898 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 00:09:38,898 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:09:36" (1/3) ... [2024-11-07 00:09:38,899 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fde2ca8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:09:38, skipping insertion in model container [2024-11-07 00:09:38,899 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:09:37" (2/3) ... [2024-11-07 00:09:38,900 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fde2ca8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:09:38, skipping insertion in model container [2024-11-07 00:09:38,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:09:38" (3/3) ... [2024-11-07 00:09:38,902 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c [2024-11-07 00:09:38,919 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 00:09:38,920 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 00:09:39,006 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 00:09:39,018 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;@3f35f9ed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 00:09:39,019 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 00:09:39,028 INFO L276 IsEmpty]: Start isEmpty. Operand has 296 states, 294 states have (on average 1.816326530612245) internal successors, (534), 295 states have internal predecessors, (534), 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:09:39,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-07 00:09:39,043 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:09:39,044 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] [2024-11-07 00:09:39,044 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:09:39,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:09:39,048 INFO L85 PathProgramCache]: Analyzing trace with hash -68624792, now seen corresponding path program 1 times [2024-11-07 00:09:39,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:09:39,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168343861] [2024-11-07 00:09:39,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:09:39,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:09:39,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:09:39,621 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:09:39,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:09:39,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168343861] [2024-11-07 00:09:39,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168343861] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:09:39,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:09:39,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 00:09:39,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651462146] [2024-11-07 00:09:39,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:09:39,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 00:09:39,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:09:39,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 00:09:39,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 00:09:39,660 INFO L87 Difference]: Start difference. First operand has 296 states, 294 states have (on average 1.816326530612245) internal successors, (534), 295 states have internal predecessors, (534), 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 2 states, 2 states have (on average 38.5) internal successors, (77), 2 states have internal predecessors, (77), 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:09:39,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:09:39,708 INFO L93 Difference]: Finished difference Result 405 states and 727 transitions. [2024-11-07 00:09:39,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 00:09:39,710 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 38.5) internal successors, (77), 2 states have internal predecessors, (77), 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 77 [2024-11-07 00:09:39,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:09:39,723 INFO L225 Difference]: With dead ends: 405 [2024-11-07 00:09:39,724 INFO L226 Difference]: Without dead ends: 292 [2024-11-07 00:09:39,728 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 00:09:39,730 INFO L432 NwaCegarLoop]: 527 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:09:39,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:09:39,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-11-07 00:09:39,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2024-11-07 00:09:39,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 291 states have (on average 1.8109965635738832) internal successors, (527), 291 states have internal predecessors, (527), 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:09:39,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 527 transitions. [2024-11-07 00:09:39,783 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 527 transitions. Word has length 77 [2024-11-07 00:09:39,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:09:39,784 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 527 transitions. [2024-11-07 00:09:39,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 38.5) internal successors, (77), 2 states have internal predecessors, (77), 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:09:39,785 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 527 transitions. [2024-11-07 00:09:39,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-07 00:09:39,789 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:09:39,789 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] [2024-11-07 00:09:39,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 00:09:39,790 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:09:39,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:09:39,791 INFO L85 PathProgramCache]: Analyzing trace with hash -202638298, now seen corresponding path program 1 times [2024-11-07 00:09:39,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:09:39,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742705707] [2024-11-07 00:09:39,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:09:39,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:09:39,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:09:40,349 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:09:40,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:09:40,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742705707] [2024-11-07 00:09:40,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742705707] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:09:40,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:09:40,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:09:40,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385923895] [2024-11-07 00:09:40,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:09:40,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:09:40,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:09:40,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:09:40,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:09:40,356 INFO L87 Difference]: Start difference. First operand 292 states and 527 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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:09:40,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:09:40,571 INFO L93 Difference]: Finished difference Result 404 states and 720 transitions. [2024-11-07 00:09:40,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:09:40,576 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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 77 [2024-11-07 00:09:40,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:09:40,578 INFO L225 Difference]: With dead ends: 404 [2024-11-07 00:09:40,578 INFO L226 Difference]: Without dead ends: 292 [2024-11-07 00:09:40,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:09:40,584 INFO L432 NwaCegarLoop]: 525 mSDtfsCounter, 0 mSDsluCounter, 1536 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2061 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:09:40,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2061 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:09:40,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-11-07 00:09:40,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2024-11-07 00:09:40,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 291 states have (on average 1.6941580756013745) internal successors, (493), 291 states have internal predecessors, (493), 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:09:40,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 493 transitions. [2024-11-07 00:09:40,613 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 493 transitions. Word has length 77 [2024-11-07 00:09:40,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:09:40,615 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 493 transitions. [2024-11-07 00:09:40,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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:09:40,616 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 493 transitions. [2024-11-07 00:09:40,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-07 00:09:40,618 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:09:40,619 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] [2024-11-07 00:09:40,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 00:09:40,619 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:09:40,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:09:40,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1614999342, now seen corresponding path program 1 times [2024-11-07 00:09:40,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:09:40,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448999140] [2024-11-07 00:09:40,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:09:40,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:09:40,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:09:40,942 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:09:40,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:09:40,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448999140] [2024-11-07 00:09:40,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448999140] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:09:40,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:09:40,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:09:40,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144204130] [2024-11-07 00:09:40,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:09:40,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:09:40,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:09:40,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:09:40,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:09:40,944 INFO L87 Difference]: Start difference. First operand 292 states and 493 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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:09:41,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:09:41,023 INFO L93 Difference]: Finished difference Result 496 states and 849 transitions. [2024-11-07 00:09:41,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:09:41,024 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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 110 [2024-11-07 00:09:41,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:09:41,026 INFO L225 Difference]: With dead ends: 496 [2024-11-07 00:09:41,027 INFO L226 Difference]: Without dead ends: 388 [2024-11-07 00:09:41,030 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:09:41,032 INFO L432 NwaCegarLoop]: 486 mSDtfsCounter, 158 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:09:41,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 934 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:09:41,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-11-07 00:09:41,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 385. [2024-11-07 00:09:41,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 384 states have (on average 1.6979166666666667) internal successors, (652), 384 states have internal predecessors, (652), 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:09:41,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 652 transitions. [2024-11-07 00:09:41,066 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 652 transitions. Word has length 110 [2024-11-07 00:09:41,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:09:41,067 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 652 transitions. [2024-11-07 00:09:41,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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:09:41,068 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 652 transitions. [2024-11-07 00:09:41,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-07 00:09:41,074 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:09:41,074 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] [2024-11-07 00:09:41,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 00:09:41,074 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:09:41,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:09:41,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1223121645, now seen corresponding path program 1 times [2024-11-07 00:09:41,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:09:41,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054125118] [2024-11-07 00:09:41,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:09:41,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:09:41,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:09:41,348 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:09:41,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:09:41,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054125118] [2024-11-07 00:09:41,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054125118] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:09:41,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:09:41,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:09:41,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414874821] [2024-11-07 00:09:41,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:09:41,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:09:41,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:09:41,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:09:41,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:09:41,351 INFO L87 Difference]: Start difference. First operand 385 states and 652 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 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:09:41,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:09:41,409 INFO L93 Difference]: Finished difference Result 767 states and 1312 transitions. [2024-11-07 00:09:41,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:09:41,412 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 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 113 [2024-11-07 00:09:41,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:09:41,415 INFO L225 Difference]: With dead ends: 767 [2024-11-07 00:09:41,416 INFO L226 Difference]: Without dead ends: 566 [2024-11-07 00:09:41,417 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:09:41,418 INFO L432 NwaCegarLoop]: 490 mSDtfsCounter, 159 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 947 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:09:41,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 947 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:09:41,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2024-11-07 00:09:41,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 562. [2024-11-07 00:09:41,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 561 states have (on average 1.7058823529411764) internal successors, (957), 561 states have internal predecessors, (957), 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:09:41,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 957 transitions. [2024-11-07 00:09:41,446 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 957 transitions. Word has length 113 [2024-11-07 00:09:41,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:09:41,447 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 957 transitions. [2024-11-07 00:09:41,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 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:09:41,447 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 957 transitions. [2024-11-07 00:09:41,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-07 00:09:41,449 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:09:41,450 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] [2024-11-07 00:09:41,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 00:09:41,450 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:09:41,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:09:41,451 INFO L85 PathProgramCache]: Analyzing trace with hash -48965666, now seen corresponding path program 1 times [2024-11-07 00:09:41,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:09:41,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256740538] [2024-11-07 00:09:41,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:09:41,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:09:41,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:09:41,705 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:09:41,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:09:41,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256740538] [2024-11-07 00:09:41,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256740538] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:09:41,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:09:41,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:09:41,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527722531] [2024-11-07 00:09:41,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:09:41,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:09:41,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:09:41,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:09:41,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:09:41,708 INFO L87 Difference]: Start difference. First operand 562 states and 957 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 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:09:41,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:09:41,774 INFO L93 Difference]: Finished difference Result 1278 states and 2191 transitions. [2024-11-07 00:09:41,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:09:41,775 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 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 116 [2024-11-07 00:09:41,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:09:41,780 INFO L225 Difference]: With dead ends: 1278 [2024-11-07 00:09:41,781 INFO L226 Difference]: Without dead ends: 900 [2024-11-07 00:09:41,783 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:09:41,786 INFO L432 NwaCegarLoop]: 490 mSDtfsCounter, 152 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 948 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:09:41,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 948 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:09:41,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2024-11-07 00:09:41,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 894. [2024-11-07 00:09:41,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 894 states, 893 states have (on average 1.707726763717805) internal successors, (1525), 893 states have internal predecessors, (1525), 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:09:41,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1525 transitions. [2024-11-07 00:09:41,831 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1525 transitions. Word has length 116 [2024-11-07 00:09:41,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:09:41,832 INFO L471 AbstractCegarLoop]: Abstraction has 894 states and 1525 transitions. [2024-11-07 00:09:41,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 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:09:41,832 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1525 transitions. [2024-11-07 00:09:41,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-07 00:09:41,835 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:09:41,835 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] [2024-11-07 00:09:41,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 00:09:41,835 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:09:41,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:09:41,836 INFO L85 PathProgramCache]: Analyzing trace with hash 302161375, now seen corresponding path program 1 times [2024-11-07 00:09:41,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:09:41,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321794903] [2024-11-07 00:09:41,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:09:41,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:09:41,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:09:42,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:09:42,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:09:42,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321794903] [2024-11-07 00:09:42,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321794903] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:09:42,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:09:42,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:09:42,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356942109] [2024-11-07 00:09:42,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:09:42,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:09:42,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:09:42,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:09:42,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:09:42,076 INFO L87 Difference]: Start difference. First operand 894 states and 1525 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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:09:42,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:09:42,135 INFO L93 Difference]: Finished difference Result 2234 states and 3823 transitions. [2024-11-07 00:09:42,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:09:42,136 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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 119 [2024-11-07 00:09:42,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:09:42,146 INFO L225 Difference]: With dead ends: 2234 [2024-11-07 00:09:42,146 INFO L226 Difference]: Without dead ends: 1524 [2024-11-07 00:09:42,148 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:09:42,150 INFO L432 NwaCegarLoop]: 490 mSDtfsCounter, 145 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 949 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:09:42,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 949 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:09:42,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1524 states. [2024-11-07 00:09:42,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1524 to 1514. [2024-11-07 00:09:42,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1514 states, 1513 states have (on average 1.7032385988103107) internal successors, (2577), 1513 states have internal predecessors, (2577), 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:09:42,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 2577 transitions. [2024-11-07 00:09:42,229 INFO L78 Accepts]: Start accepts. Automaton has 1514 states and 2577 transitions. Word has length 119 [2024-11-07 00:09:42,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:09:42,229 INFO L471 AbstractCegarLoop]: Abstraction has 1514 states and 2577 transitions. [2024-11-07 00:09:42,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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:09:42,230 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 2577 transitions. [2024-11-07 00:09:42,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-07 00:09:42,232 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:09:42,232 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] [2024-11-07 00:09:42,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 00:09:42,233 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:09:42,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:09:42,233 INFO L85 PathProgramCache]: Analyzing trace with hash 659927786, now seen corresponding path program 1 times [2024-11-07 00:09:42,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:09:42,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779417984] [2024-11-07 00:09:42,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:09:42,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:09:42,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:09:42,538 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:09:42,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:09:42,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779417984] [2024-11-07 00:09:42,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779417984] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:09:42,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:09:42,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:09:42,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741198301] [2024-11-07 00:09:42,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:09:42,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:09:42,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:09:42,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:09:42,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:09:42,543 INFO L87 Difference]: Start difference. First operand 1514 states and 2577 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 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:09:42,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:09:42,933 INFO L93 Difference]: Finished difference Result 7782 states and 13401 transitions. [2024-11-07 00:09:42,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 00:09:42,934 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 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 122 [2024-11-07 00:09:42,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:09:42,966 INFO L225 Difference]: With dead ends: 7782 [2024-11-07 00:09:42,966 INFO L226 Difference]: Without dead ends: 6452 [2024-11-07 00:09:42,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-07 00:09:42,972 INFO L432 NwaCegarLoop]: 491 mSDtfsCounter, 1636 mSDsluCounter, 3695 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1636 SdHoareTripleChecker+Valid, 4186 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:09:42,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1636 Valid, 4186 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 00:09:42,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6452 states. [2024-11-07 00:09:43,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6452 to 2754. [2024-11-07 00:09:43,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2754 states, 2753 states have (on average 1.7050490374137304) internal successors, (4694), 2753 states have internal predecessors, (4694), 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:09:43,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2754 states to 2754 states and 4694 transitions. [2024-11-07 00:09:43,135 INFO L78 Accepts]: Start accepts. Automaton has 2754 states and 4694 transitions. Word has length 122 [2024-11-07 00:09:43,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:09:43,135 INFO L471 AbstractCegarLoop]: Abstraction has 2754 states and 4694 transitions. [2024-11-07 00:09:43,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 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:09:43,135 INFO L276 IsEmpty]: Start isEmpty. Operand 2754 states and 4694 transitions. [2024-11-07 00:09:43,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-07 00:09:43,138 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:09:43,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] [2024-11-07 00:09:43,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 00:09:43,139 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:09:43,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:09:43,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1183285489, now seen corresponding path program 1 times [2024-11-07 00:09:43,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:09:43,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141536749] [2024-11-07 00:09:43,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:09:43,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:09:43,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:09:43,354 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:09:43,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:09:43,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141536749] [2024-11-07 00:09:43,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141536749] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:09:43,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:09:43,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:09:43,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458604987] [2024-11-07 00:09:43,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:09:43,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:09:43,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:09:43,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:09:43,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:09:43,358 INFO L87 Difference]: Start difference. First operand 2754 states and 4694 transitions. Second operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 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:09:43,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:09:43,544 INFO L93 Difference]: Finished difference Result 8046 states and 13812 transitions. [2024-11-07 00:09:43,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:09:43,544 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 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 123 [2024-11-07 00:09:43,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:09:43,572 INFO L225 Difference]: With dead ends: 8046 [2024-11-07 00:09:43,572 INFO L226 Difference]: Without dead ends: 5476 [2024-11-07 00:09:43,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:09:43,581 INFO L432 NwaCegarLoop]: 494 mSDtfsCounter, 545 mSDsluCounter, 1097 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 1591 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:09:43,581 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 1591 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:09:43,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5476 states. [2024-11-07 00:09:43,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5476 to 4098. [2024-11-07 00:09:43,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4098 states, 4097 states have (on average 1.707835001220405) internal successors, (6997), 4097 states have internal predecessors, (6997), 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:09:43,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 6997 transitions. [2024-11-07 00:09:43,772 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 6997 transitions. Word has length 123 [2024-11-07 00:09:43,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:09:43,772 INFO L471 AbstractCegarLoop]: Abstraction has 4098 states and 6997 transitions. [2024-11-07 00:09:43,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 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:09:43,772 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 6997 transitions. [2024-11-07 00:09:43,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 00:09:43,776 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:09:43,777 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] [2024-11-07 00:09:43,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 00:09:43,777 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:09:43,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:09:43,777 INFO L85 PathProgramCache]: Analyzing trace with hash 396509441, now seen corresponding path program 1 times [2024-11-07 00:09:43,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:09:43,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878866966] [2024-11-07 00:09:43,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:09:43,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:09:43,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:09:43,991 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:09:43,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:09:43,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878866966] [2024-11-07 00:09:43,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878866966] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:09:43,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:09:43,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:09:43,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510580564] [2024-11-07 00:09:43,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:09:43,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:09:43,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:09:43,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:09:43,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:09:43,994 INFO L87 Difference]: Start difference. First operand 4098 states and 6997 transitions. Second operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 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:09:44,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:09:44,231 INFO L93 Difference]: Finished difference Result 12020 states and 20592 transitions. [2024-11-07 00:09:44,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:09:44,232 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 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 124 [2024-11-07 00:09:44,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:09:44,272 INFO L225 Difference]: With dead ends: 12020 [2024-11-07 00:09:44,272 INFO L226 Difference]: Without dead ends: 8106 [2024-11-07 00:09:44,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:09:44,283 INFO L432 NwaCegarLoop]: 482 mSDtfsCounter, 545 mSDsluCounter, 1099 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 1581 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:09:44,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 1581 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:09:44,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8106 states. [2024-11-07 00:09:44,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8106 to 6078. [2024-11-07 00:09:44,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6078 states, 6077 states have (on average 1.7046239921013657) internal successors, (10359), 6077 states have internal predecessors, (10359), 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:09:44,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6078 states to 6078 states and 10359 transitions. [2024-11-07 00:09:44,563 INFO L78 Accepts]: Start accepts. Automaton has 6078 states and 10359 transitions. Word has length 124 [2024-11-07 00:09:44,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:09:44,563 INFO L471 AbstractCegarLoop]: Abstraction has 6078 states and 10359 transitions. [2024-11-07 00:09:44,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 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:09:44,564 INFO L276 IsEmpty]: Start isEmpty. Operand 6078 states and 10359 transitions. [2024-11-07 00:09:44,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-07 00:09:44,568 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:09:44,568 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] [2024-11-07 00:09:44,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 00:09:44,569 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:09:44,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:09:44,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1945260072, now seen corresponding path program 1 times [2024-11-07 00:09:44,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:09:44,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668983228] [2024-11-07 00:09:44,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:09:44,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:09:44,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:09:44,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:09:44,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:09:44,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668983228] [2024-11-07 00:09:44,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668983228] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:09:44,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:09:44,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:09:44,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903268226] [2024-11-07 00:09:44,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:09:44,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:09:44,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:09:44,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:09:44,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:09:44,769 INFO L87 Difference]: Start difference. First operand 6078 states and 10359 transitions. Second operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 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:09:45,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:09:45,025 INFO L93 Difference]: Finished difference Result 17900 states and 30600 transitions. [2024-11-07 00:09:45,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:09:45,027 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 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 125 [2024-11-07 00:09:45,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:09:45,078 INFO L225 Difference]: With dead ends: 17900 [2024-11-07 00:09:45,078 INFO L226 Difference]: Without dead ends: 12006 [2024-11-07 00:09:45,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:09:45,094 INFO L432 NwaCegarLoop]: 481 mSDtfsCounter, 543 mSDsluCounter, 1048 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 1529 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:09:45,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [543 Valid, 1529 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:09:45,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12006 states. [2024-11-07 00:09:45,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12006 to 9008. [2024-11-07 00:09:45,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9008 states, 9007 states have (on average 1.7012323748195848) internal successors, (15323), 9007 states have internal predecessors, (15323), 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:09:45,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9008 states to 9008 states and 15323 transitions. [2024-11-07 00:09:45,502 INFO L78 Accepts]: Start accepts. Automaton has 9008 states and 15323 transitions. Word has length 125 [2024-11-07 00:09:45,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:09:45,502 INFO L471 AbstractCegarLoop]: Abstraction has 9008 states and 15323 transitions. [2024-11-07 00:09:45,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 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:09:45,503 INFO L276 IsEmpty]: Start isEmpty. Operand 9008 states and 15323 transitions. [2024-11-07 00:09:45,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-07 00:09:45,508 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:09:45,508 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] [2024-11-07 00:09:45,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 00:09:45,509 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:09:45,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:09:45,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1807275480, now seen corresponding path program 1 times [2024-11-07 00:09:45,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:09:45,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781228916] [2024-11-07 00:09:45,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:09:45,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:09:45,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:09:45,661 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:09:45,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:09:45,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781228916] [2024-11-07 00:09:45,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781228916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:09:45,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:09:45,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:09:45,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419700451] [2024-11-07 00:09:45,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:09:45,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:09:45,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:09:45,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:09:45,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:09:45,663 INFO L87 Difference]: Start difference. First operand 9008 states and 15323 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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:09:45,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:09:45,836 INFO L93 Difference]: Finished difference Result 20279 states and 34633 transitions. [2024-11-07 00:09:45,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:09:45,837 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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 126 [2024-11-07 00:09:45,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:09:45,878 INFO L225 Difference]: With dead ends: 20279 [2024-11-07 00:09:45,879 INFO L226 Difference]: Without dead ends: 13980 [2024-11-07 00:09:45,894 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:09:45,895 INFO L432 NwaCegarLoop]: 633 mSDtfsCounter, 165 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 1094 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:09:45,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 1094 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:09:45,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13980 states. [2024-11-07 00:09:46,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13980 to 13978. [2024-11-07 00:09:46,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13978 states, 13977 states have (on average 1.6968591257065178) internal successors, (23717), 13977 states have internal predecessors, (23717), 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:09:46,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13978 states to 13978 states and 23717 transitions. [2024-11-07 00:09:46,349 INFO L78 Accepts]: Start accepts. Automaton has 13978 states and 23717 transitions. Word has length 126 [2024-11-07 00:09:46,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:09:46,349 INFO L471 AbstractCegarLoop]: Abstraction has 13978 states and 23717 transitions. [2024-11-07 00:09:46,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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:09:46,350 INFO L276 IsEmpty]: Start isEmpty. Operand 13978 states and 23717 transitions. [2024-11-07 00:09:46,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-07 00:09:46,353 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:09:46,353 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] [2024-11-07 00:09:46,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 00:09:46,353 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:09:46,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:09:46,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1017500356, now seen corresponding path program 1 times [2024-11-07 00:09:46,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:09:46,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243665545] [2024-11-07 00:09:46,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:09:46,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:09:46,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:09:46,504 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:09:46,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:09:46,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243665545] [2024-11-07 00:09:46,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243665545] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:09:46,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:09:46,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:09:46,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724203330] [2024-11-07 00:09:46,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:09:46,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:09:46,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:09:46,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:09:46,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:09:46,506 INFO L87 Difference]: Start difference. First operand 13978 states and 23717 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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:09:46,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:09:46,808 INFO L93 Difference]: Finished difference Result 31215 states and 52947 transitions. [2024-11-07 00:09:46,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:09:46,809 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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 126 [2024-11-07 00:09:46,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:09:46,872 INFO L225 Difference]: With dead ends: 31215 [2024-11-07 00:09:46,872 INFO L226 Difference]: Without dead ends: 21488 [2024-11-07 00:09:46,898 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:09:46,900 INFO L432 NwaCegarLoop]: 625 mSDtfsCounter, 158 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:09:46,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 1087 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:09:46,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21488 states. [2024-11-07 00:09:47,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21488 to 21486. [2024-11-07 00:09:47,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21486 states, 21485 states have (on average 1.6861065859902258) internal successors, (36226), 21485 states have internal predecessors, (36226), 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:09:47,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21486 states to 21486 states and 36226 transitions. [2024-11-07 00:09:47,683 INFO L78 Accepts]: Start accepts. Automaton has 21486 states and 36226 transitions. Word has length 126 [2024-11-07 00:09:47,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:09:47,683 INFO L471 AbstractCegarLoop]: Abstraction has 21486 states and 36226 transitions. [2024-11-07 00:09:47,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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:09:47,684 INFO L276 IsEmpty]: Start isEmpty. Operand 21486 states and 36226 transitions. [2024-11-07 00:09:47,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-07 00:09:47,685 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:09:47,686 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] [2024-11-07 00:09:47,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 00:09:47,686 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:09:47,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:09:47,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1414073576, now seen corresponding path program 1 times [2024-11-07 00:09:47,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:09:47,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724466121] [2024-11-07 00:09:47,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:09:47,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:09:47,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:09:47,869 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:09:47,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:09:47,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724466121] [2024-11-07 00:09:47,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724466121] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:09:47,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:09:47,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:09:47,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920853027] [2024-11-07 00:09:47,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:09:47,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:09:47,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:09:47,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:09:47,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:09:47,872 INFO L87 Difference]: Start difference. First operand 21486 states and 36226 transitions. Second operand has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 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:09:48,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:09:48,477 INFO L93 Difference]: Finished difference Result 64140 states and 108482 transitions. [2024-11-07 00:09:48,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:09:48,478 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 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 126 [2024-11-07 00:09:48,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:09:48,606 INFO L225 Difference]: With dead ends: 64140 [2024-11-07 00:09:48,607 INFO L226 Difference]: Without dead ends: 42850 [2024-11-07 00:09:48,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:09:48,647 INFO L432 NwaCegarLoop]: 547 mSDtfsCounter, 541 mSDsluCounter, 1103 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 1650 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:09:48,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 1650 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:09:48,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42850 states. [2024-11-07 00:09:49,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42850 to 32034. [2024-11-07 00:09:49,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32034 states, 32033 states have (on average 1.6817968969500203) internal successors, (53873), 32033 states have internal predecessors, (53873), 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:09:49,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32034 states to 32034 states and 53873 transitions. [2024-11-07 00:09:49,777 INFO L78 Accepts]: Start accepts. Automaton has 32034 states and 53873 transitions. Word has length 126 [2024-11-07 00:09:49,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:09:49,777 INFO L471 AbstractCegarLoop]: Abstraction has 32034 states and 53873 transitions. [2024-11-07 00:09:49,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 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:09:49,777 INFO L276 IsEmpty]: Start isEmpty. Operand 32034 states and 53873 transitions. [2024-11-07 00:09:49,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-07 00:09:49,779 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:09:49,779 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] [2024-11-07 00:09:49,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 00:09:49,779 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:09:49,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:09:49,780 INFO L85 PathProgramCache]: Analyzing trace with hash -148704068, now seen corresponding path program 1 times [2024-11-07 00:09:49,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:09:49,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079385976] [2024-11-07 00:09:49,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:09:49,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:09:49,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:09:49,927 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:09:49,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:09:49,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079385976] [2024-11-07 00:09:49,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079385976] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:09:49,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:09:49,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:09:49,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196308592] [2024-11-07 00:09:49,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:09:49,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:09:49,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:09:49,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:09:49,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:09:49,929 INFO L87 Difference]: Start difference. First operand 32034 states and 53873 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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:09:50,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:09:50,771 INFO L93 Difference]: Finished difference Result 71790 states and 120614 transitions. [2024-11-07 00:09:50,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:09:50,772 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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 126 [2024-11-07 00:09:50,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:09:50,941 INFO L225 Difference]: With dead ends: 71790 [2024-11-07 00:09:50,942 INFO L226 Difference]: Without dead ends: 49176 [2024-11-07 00:09:50,981 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:09:50,982 INFO L432 NwaCegarLoop]: 572 mSDtfsCounter, 144 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 1036 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:09:50,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 1036 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:09:51,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49176 states. [2024-11-07 00:09:52,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49176 to 49174. [2024-11-07 00:09:52,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49174 states, 49173 states have (on average 1.6684562666503975) internal successors, (82043), 49173 states have internal predecessors, (82043), 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:09:52,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49174 states to 49174 states and 82043 transitions. [2024-11-07 00:09:52,366 INFO L78 Accepts]: Start accepts. Automaton has 49174 states and 82043 transitions. Word has length 126 [2024-11-07 00:09:52,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:09:52,367 INFO L471 AbstractCegarLoop]: Abstraction has 49174 states and 82043 transitions. [2024-11-07 00:09:52,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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:09:52,367 INFO L276 IsEmpty]: Start isEmpty. Operand 49174 states and 82043 transitions. [2024-11-07 00:09:52,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-07 00:09:52,368 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:09:52,368 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] [2024-11-07 00:09:52,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 00:09:52,369 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:09:52,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:09:52,369 INFO L85 PathProgramCache]: Analyzing trace with hash -513237416, now seen corresponding path program 1 times [2024-11-07 00:09:52,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:09:52,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894816579] [2024-11-07 00:09:52,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:09:52,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:09:52,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:09:52,493 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:09:52,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:09:52,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894816579] [2024-11-07 00:09:52,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894816579] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:09:52,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:09:52,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:09:52,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101992379] [2024-11-07 00:09:52,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:09:52,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:09:52,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:09:52,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:09:52,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:09:52,495 INFO L87 Difference]: Start difference. First operand 49174 states and 82043 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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:09:53,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:09:53,486 INFO L93 Difference]: Finished difference Result 109607 states and 182609 transitions. [2024-11-07 00:09:53,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:09:53,487 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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 126 [2024-11-07 00:09:53,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:09:53,756 INFO L225 Difference]: With dead ends: 109607 [2024-11-07 00:09:53,757 INFO L226 Difference]: Without dead ends: 74752 [2024-11-07 00:09:53,810 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:09:53,811 INFO L432 NwaCegarLoop]: 609 mSDtfsCounter, 151 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 1072 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:09:53,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 1072 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:09:53,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74752 states. [2024-11-07 00:09:55,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74752 to 74750. [2024-11-07 00:09:55,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74750 states, 74749 states have (on average 1.652624115372781) internal successors, (123532), 74749 states have internal predecessors, (123532), 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:09:55,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74750 states to 74750 states and 123532 transitions. [2024-11-07 00:09:55,962 INFO L78 Accepts]: Start accepts. Automaton has 74750 states and 123532 transitions. Word has length 126 [2024-11-07 00:09:55,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:09:55,962 INFO L471 AbstractCegarLoop]: Abstraction has 74750 states and 123532 transitions. [2024-11-07 00:09:55,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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:09:55,963 INFO L276 IsEmpty]: Start isEmpty. Operand 74750 states and 123532 transitions. [2024-11-07 00:09:55,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-07 00:09:55,964 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:09:55,964 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] [2024-11-07 00:09:55,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 00:09:55,964 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:09:55,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:09:55,965 INFO L85 PathProgramCache]: Analyzing trace with hash 363774192, now seen corresponding path program 1 times [2024-11-07 00:09:55,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:09:55,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142050090] [2024-11-07 00:09:55,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:09:55,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:09:56,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:09:56,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:09:56,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:09:56,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142050090] [2024-11-07 00:09:56,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142050090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:09:56,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:09:56,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:09:56,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053039136] [2024-11-07 00:09:56,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:09:56,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:09:56,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:09:56,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:09:56,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:09:56,402 INFO L87 Difference]: Start difference. First operand 74750 states and 123532 transitions. Second operand has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 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:09:57,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:09:57,797 INFO L93 Difference]: Finished difference Result 149286 states and 246711 transitions. [2024-11-07 00:09:57,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:09:57,798 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 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 128 [2024-11-07 00:09:57,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:09:58,052 INFO L225 Difference]: With dead ends: 149286 [2024-11-07 00:09:58,053 INFO L226 Difference]: Without dead ends: 74752 [2024-11-07 00:09:58,136 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:09:58,137 INFO L432 NwaCegarLoop]: 490 mSDtfsCounter, 444 mSDsluCounter, 1359 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 1849 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:09:58,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 1849 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:09:58,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74752 states. [2024-11-07 00:09:59,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74752 to 74750. [2024-11-07 00:09:59,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74750 states, 74749 states have (on average 1.6442627995023344) internal successors, (122907), 74749 states have internal predecessors, (122907), 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:09:59,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74750 states to 74750 states and 122907 transitions. [2024-11-07 00:09:59,999 INFO L78 Accepts]: Start accepts. Automaton has 74750 states and 122907 transitions. Word has length 128 [2024-11-07 00:09:59,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:09:59,999 INFO L471 AbstractCegarLoop]: Abstraction has 74750 states and 122907 transitions. [2024-11-07 00:09:59,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 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:09:59,999 INFO L276 IsEmpty]: Start isEmpty. Operand 74750 states and 122907 transitions. [2024-11-07 00:10:00,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-07 00:10:00,001 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:10:00,001 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] [2024-11-07 00:10:00,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 00:10:00,001 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:10:00,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:10:00,002 INFO L85 PathProgramCache]: Analyzing trace with hash -52909269, now seen corresponding path program 1 times [2024-11-07 00:10:00,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:10:00,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359608055] [2024-11-07 00:10:00,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:10:00,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:10:00,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:10:00,371 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:10:00,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:10:00,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359608055] [2024-11-07 00:10:00,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359608055] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:10:00,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:10:00,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:10:00,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61126467] [2024-11-07 00:10:00,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:10:00,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:10:00,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:10:00,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:10:00,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:10:00,373 INFO L87 Difference]: Start difference. First operand 74750 states and 122907 transitions. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 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:10:02,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:10:02,270 INFO L93 Difference]: Finished difference Result 218644 states and 359923 transitions. [2024-11-07 00:10:02,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:10:02,271 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 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 131 [2024-11-07 00:10:02,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:10:02,651 INFO L225 Difference]: With dead ends: 218644 [2024-11-07 00:10:02,651 INFO L226 Difference]: Without dead ends: 144110 [2024-11-07 00:10:02,741 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:10:02,741 INFO L432 NwaCegarLoop]: 481 mSDtfsCounter, 293 mSDsluCounter, 1377 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 1858 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:10:02,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 1858 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:10:02,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144110 states. [2024-11-07 00:10:05,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144110 to 144108. [2024-11-07 00:10:05,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144108 states, 144107 states have (on average 1.6331753488727125) internal successors, (235352), 144107 states have internal predecessors, (235352), 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:10:05,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144108 states to 144108 states and 235352 transitions. [2024-11-07 00:10:05,549 INFO L78 Accepts]: Start accepts. Automaton has 144108 states and 235352 transitions. Word has length 131 [2024-11-07 00:10:05,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:10:05,549 INFO L471 AbstractCegarLoop]: Abstraction has 144108 states and 235352 transitions. [2024-11-07 00:10:05,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 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:10:05,550 INFO L276 IsEmpty]: Start isEmpty. Operand 144108 states and 235352 transitions. [2024-11-07 00:10:05,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-07 00:10:05,551 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:10:05,551 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:10:05,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 00:10:05,551 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:10:05,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:10:05,552 INFO L85 PathProgramCache]: Analyzing trace with hash -2071532711, now seen corresponding path program 1 times [2024-11-07 00:10:05,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:10:05,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87893359] [2024-11-07 00:10:05,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:10:05,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:10:06,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:10:06,425 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:10:06,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:10:06,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87893359] [2024-11-07 00:10:06,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87893359] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:10:06,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:10:06,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:10:06,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71864614] [2024-11-07 00:10:06,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:10:06,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:10:06,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:10:06,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:10:06,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:10:06,427 INFO L87 Difference]: Start difference. First operand 144108 states and 235352 transitions. Second operand has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 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:10:07,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:10:07,960 INFO L93 Difference]: Finished difference Result 149918 states and 243097 transitions. [2024-11-07 00:10:07,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:10:07,961 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 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:10:07,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:10:08,287 INFO L225 Difference]: With dead ends: 149918 [2024-11-07 00:10:08,287 INFO L226 Difference]: Without dead ends: 149916 [2024-11-07 00:10:08,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:10:08,335 INFO L432 NwaCegarLoop]: 490 mSDtfsCounter, 0 mSDsluCounter, 1455 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1945 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:10:08,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1945 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:10:08,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149916 states. [2024-11-07 00:10:10,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149916 to 149916. [2024-11-07 00:10:10,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149916 states, 149915 states have (on average 1.6084647967181402) internal successors, (241133), 149915 states have internal predecessors, (241133), 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:10:11,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149916 states to 149916 states and 241133 transitions. [2024-11-07 00:10:11,411 INFO L78 Accepts]: Start accepts. Automaton has 149916 states and 241133 transitions. Word has length 132 [2024-11-07 00:10:11,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:10:11,412 INFO L471 AbstractCegarLoop]: Abstraction has 149916 states and 241133 transitions. [2024-11-07 00:10:11,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 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:10:11,412 INFO L276 IsEmpty]: Start isEmpty. Operand 149916 states and 241133 transitions. [2024-11-07 00:10:11,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-07 00:10:11,418 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:10:11,418 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:11,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 00:10:11,419 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:10:11,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:10:11,420 INFO L85 PathProgramCache]: Analyzing trace with hash -812495345, now seen corresponding path program 1 times [2024-11-07 00:10:11,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:10:11,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325188257] [2024-11-07 00:10:11,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:10:11,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:10:11,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:10:11,791 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 00:10:11,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:10:11,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325188257] [2024-11-07 00:10:11,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325188257] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:10:11,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:10:11,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:10:11,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571425004] [2024-11-07 00:10:11,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:10:11,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:10:11,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:10:11,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:10:11,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:10:11,793 INFO L87 Difference]: Start difference. First operand 149916 states and 241133 transitions. Second operand has 6 states, 6 states have (on average 28.166666666666668) internal successors, (169), 6 states have internal predecessors, (169), 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:10:15,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:10:15,376 INFO L93 Difference]: Finished difference Result 413286 states and 666700 transitions. [2024-11-07 00:10:15,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:10:15,377 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.166666666666668) internal successors, (169), 6 states have internal predecessors, (169), 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 170 [2024-11-07 00:10:15,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:10:16,232 INFO L225 Difference]: With dead ends: 413286 [2024-11-07 00:10:16,233 INFO L226 Difference]: Without dead ends: 345484 [2024-11-07 00:10:16,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:10:16,388 INFO L432 NwaCegarLoop]: 659 mSDtfsCounter, 1212 mSDsluCounter, 2196 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1212 SdHoareTripleChecker+Valid, 2855 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:10:16,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1212 Valid, 2855 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:10:16,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345484 states. [2024-11-07 00:10:22,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345484 to 242064. [2024-11-07 00:10:22,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242064 states, 242063 states have (on average 1.6056522475553885) internal successors, (388669), 242063 states have internal predecessors, (388669), 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:10:22,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242064 states to 242064 states and 388669 transitions. [2024-11-07 00:10:23,008 INFO L78 Accepts]: Start accepts. Automaton has 242064 states and 388669 transitions. Word has length 170 [2024-11-07 00:10:23,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:10:23,008 INFO L471 AbstractCegarLoop]: Abstraction has 242064 states and 388669 transitions. [2024-11-07 00:10:23,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.166666666666668) internal successors, (169), 6 states have internal predecessors, (169), 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:10:23,009 INFO L276 IsEmpty]: Start isEmpty. Operand 242064 states and 388669 transitions. [2024-11-07 00:10:23,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-07 00:10:23,014 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:10:23,015 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:23,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 00:10:23,015 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:10:23,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:10:23,016 INFO L85 PathProgramCache]: Analyzing trace with hash 657696115, now seen corresponding path program 1 times [2024-11-07 00:10:23,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:10:23,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096999038] [2024-11-07 00:10:23,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:10:23,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:10:23,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:10:23,426 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-07 00:10:23,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:10:23,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096999038] [2024-11-07 00:10:23,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096999038] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:10:23,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:10:23,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:10:23,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659532372] [2024-11-07 00:10:23,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:10:23,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:10:23,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:10:23,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:10:23,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:10:23,428 INFO L87 Difference]: Start difference. First operand 242064 states and 388669 transitions. Second operand has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 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:10:27,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:10:27,643 INFO L93 Difference]: Finished difference Result 465314 states and 750738 transitions. [2024-11-07 00:10:27,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:10:27,644 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 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 170 [2024-11-07 00:10:27,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:10:28,665 INFO L225 Difference]: With dead ends: 465314 [2024-11-07 00:10:28,666 INFO L226 Difference]: Without dead ends: 398812 [2024-11-07 00:10:28,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:10:28,785 INFO L432 NwaCegarLoop]: 669 mSDtfsCounter, 1214 mSDsluCounter, 2152 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1214 SdHoareTripleChecker+Valid, 2821 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:10:28,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1214 Valid, 2821 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:10:29,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398812 states.