./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.3.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_floodmax.4.3.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', '7669776db00f6295c4028d825bdd51b22a88fb95e78feea7b33da1a0ac83f7c3'] 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_floodmax.4.3.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 7669776db00f6295c4028d825bdd51b22a88fb95e78feea7b33da1a0ac83f7c3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 00:02:54,333 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 00:02:54,406 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:02:54,411 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 00:02:54,412 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 00:02:54,436 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 00:02:54,440 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 00:02:54,440 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 00:02:54,441 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 00:02:54,441 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 00:02:54,441 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 00:02:54,441 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 00:02:54,441 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 00:02:54,441 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 00:02:54,441 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 00:02:54,441 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 00:02:54,441 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 00:02:54,442 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 00:02:54,442 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 00:02:54,442 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 00:02:54,442 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 00:02:54,442 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 00:02:54,442 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 00:02:54,442 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 00:02:54,442 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 00:02:54,442 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 00:02:54,442 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 00:02:54,442 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 00:02:54,443 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 00:02:54,443 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 00:02:54,443 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 00:02:54,443 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 00:02:54,443 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:02:54,443 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 00:02:54,445 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 00:02:54,445 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 00:02:54,445 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 00:02:54,445 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 00:02:54,445 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 00:02:54,445 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 00:02:54,445 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 00:02:54,445 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 00:02:54,445 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 -> 7669776db00f6295c4028d825bdd51b22a88fb95e78feea7b33da1a0ac83f7c3 [2024-11-07 00:02:54,779 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 00:02:54,792 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 00:02:54,795 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 00:02:54,796 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 00:02:54,796 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 00:02:54,799 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.3.ufo.UNBOUNDED.pals.c [2024-11-07 00:02:56,205 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 00:02:56,561 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 00:02:56,565 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.3.ufo.UNBOUNDED.pals.c [2024-11-07 00:02:56,582 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c38e8d117/a28ba25d22584aa2a71d210606a7c347/FLAGf96136ccb [2024-11-07 00:02:56,603 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c38e8d117/a28ba25d22584aa2a71d210606a7c347 [2024-11-07 00:02:56,605 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 00:02:56,607 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 00:02:56,609 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 00:02:56,609 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 00:02:56,613 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 00:02:56,614 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:02:56" (1/1) ... [2024-11-07 00:02:56,615 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b6c04d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:02:56, skipping insertion in model container [2024-11-07 00:02:56,616 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:02:56" (1/1) ... [2024-11-07 00:02:56,655 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 00:02:56,984 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_floodmax.4.3.ufo.UNBOUNDED.pals.c[28368,28381] [2024-11-07 00:02:56,987 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:02:57,006 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 00:02:57,122 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_floodmax.4.3.ufo.UNBOUNDED.pals.c[28368,28381] [2024-11-07 00:02:57,127 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:02:57,146 INFO L204 MainTranslator]: Completed translation [2024-11-07 00:02:57,147 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:02:57 WrapperNode [2024-11-07 00:02:57,148 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 00:02:57,149 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 00:02:57,150 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 00:02:57,150 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 00:02:57,156 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:02:57" (1/1) ... [2024-11-07 00:02:57,172 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:02:57" (1/1) ... [2024-11-07 00:02:57,241 INFO L138 Inliner]: procedures = 24, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 959 [2024-11-07 00:02:57,242 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 00:02:57,247 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 00:02:57,247 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 00:02:57,247 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 00:02:57,257 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:02:57" (1/1) ... [2024-11-07 00:02:57,258 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:02:57" (1/1) ... [2024-11-07 00:02:57,269 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:02:57" (1/1) ... [2024-11-07 00:02:57,303 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:02:57,303 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:02:57" (1/1) ... [2024-11-07 00:02:57,307 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:02:57" (1/1) ... [2024-11-07 00:02:57,326 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:02:57" (1/1) ... [2024-11-07 00:02:57,352 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:02:57" (1/1) ... [2024-11-07 00:02:57,355 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:02:57" (1/1) ... [2024-11-07 00:02:57,359 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:02:57" (1/1) ... [2024-11-07 00:02:57,373 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 00:02:57,375 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 00:02:57,376 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 00:02:57,376 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 00:02:57,377 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:02:57" (1/1) ... [2024-11-07 00:02:57,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:02:57,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:02:57,415 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:02:57,418 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:02:57,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 00:02:57,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 00:02:57,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 00:02:57,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 00:02:57,609 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 00:02:57,612 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 00:02:58,917 INFO L? ?]: Removed 111 outVars from TransFormulas that were not future-live. [2024-11-07 00:02:58,917 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 00:02:58,942 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 00:02:58,945 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 00:02:58,946 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:02:58 BoogieIcfgContainer [2024-11-07 00:02:58,946 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 00:02:58,949 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 00:02:58,949 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 00:02:58,955 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 00:02:58,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:02:56" (1/3) ... [2024-11-07 00:02:58,956 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2148bc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:02:58, skipping insertion in model container [2024-11-07 00:02:58,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:02:57" (2/3) ... [2024-11-07 00:02:58,957 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2148bc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:02:58, skipping insertion in model container [2024-11-07 00:02:58,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:02:58" (3/3) ... [2024-11-07 00:02:58,959 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.3.ufo.UNBOUNDED.pals.c [2024-11-07 00:02:58,974 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 00:02:58,975 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 00:02:59,047 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 00:02:59,062 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;@70e7b875, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 00:02:59,062 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 00:02:59,072 INFO L276 IsEmpty]: Start isEmpty. Operand has 288 states, 286 states have (on average 1.8251748251748252) internal successors, (522), 287 states have internal predecessors, (522), 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:02:59,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-07 00:02:59,084 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:02:59,084 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:02:59,085 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:02:59,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:02:59,089 INFO L85 PathProgramCache]: Analyzing trace with hash 2117571860, now seen corresponding path program 1 times [2024-11-07 00:02:59,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:02:59,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180341249] [2024-11-07 00:02:59,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:02:59,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:02:59,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:59,545 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:02:59,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:02:59,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180341249] [2024-11-07 00:02:59,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180341249] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:02:59,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:02:59,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 00:02:59,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868095203] [2024-11-07 00:02:59,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:02:59,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 00:02:59,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:02:59,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 00:02:59,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 00:02:59,580 INFO L87 Difference]: Start difference. First operand has 288 states, 286 states have (on average 1.8251748251748252) internal successors, (522), 287 states have internal predecessors, (522), 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:02:59,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:02:59,624 INFO L93 Difference]: Finished difference Result 381 states and 687 transitions. [2024-11-07 00:02:59,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 00:02:59,626 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:02:59,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:02:59,637 INFO L225 Difference]: With dead ends: 381 [2024-11-07 00:02:59,638 INFO L226 Difference]: Without dead ends: 284 [2024-11-07 00:02:59,643 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:02:59,648 INFO L432 NwaCegarLoop]: 515 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, 515 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:02:59,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:02:59,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-11-07 00:02:59,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 284. [2024-11-07 00:02:59,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 283 states have (on average 1.8197879858657244) internal successors, (515), 283 states have internal predecessors, (515), 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:02:59,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 515 transitions. [2024-11-07 00:02:59,699 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 515 transitions. Word has length 77 [2024-11-07 00:02:59,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:02:59,700 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 515 transitions. [2024-11-07 00:02:59,700 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:02:59,700 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 515 transitions. [2024-11-07 00:02:59,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-07 00:02:59,703 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:02:59,703 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:02:59,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 00:02:59,704 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:02:59,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:02:59,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1983558354, now seen corresponding path program 1 times [2024-11-07 00:02:59,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:02:59,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140358405] [2024-11-07 00:02:59,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:02:59,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:02:59,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:03:00,250 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:03:00,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:03:00,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140358405] [2024-11-07 00:03:00,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140358405] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:03:00,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:03:00,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:03:00,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729941768] [2024-11-07 00:03:00,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:03:00,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:03:00,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:03:00,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:03:00,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:03:00,256 INFO L87 Difference]: Start difference. First operand 284 states and 515 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:03:00,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:03:00,407 INFO L93 Difference]: Finished difference Result 380 states and 680 transitions. [2024-11-07 00:03:00,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:03:00,408 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:03:00,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:03:00,412 INFO L225 Difference]: With dead ends: 380 [2024-11-07 00:03:00,415 INFO L226 Difference]: Without dead ends: 284 [2024-11-07 00:03:00,416 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:03:00,417 INFO L432 NwaCegarLoop]: 513 mSDtfsCounter, 0 mSDsluCounter, 1492 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2005 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:03:00,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2005 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:03:00,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-11-07 00:03:00,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 284. [2024-11-07 00:03:00,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 283 states have (on average 1.6713780918727916) internal successors, (473), 283 states have internal predecessors, (473), 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:03:00,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 473 transitions. [2024-11-07 00:03:00,438 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 473 transitions. Word has length 77 [2024-11-07 00:03:00,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:03:00,440 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 473 transitions. [2024-11-07 00:03:00,440 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:03:00,441 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 473 transitions. [2024-11-07 00:03:00,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-07 00:03:00,448 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:03:00,449 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] [2024-11-07 00:03:00,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 00:03:00,449 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:03:00,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:03:00,450 INFO L85 PathProgramCache]: Analyzing trace with hash 188392410, now seen corresponding path program 1 times [2024-11-07 00:03:00,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:03:00,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95575813] [2024-11-07 00:03:00,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:03:00,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:03:00,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:03:00,752 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:03:00,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:03:00,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95575813] [2024-11-07 00:03:00,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95575813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:03:00,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:03:00,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:03:00,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552440070] [2024-11-07 00:03:00,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:03:00,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:03:00,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:03:00,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:03:00,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:03:00,757 INFO L87 Difference]: Start difference. First operand 284 states and 473 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 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:03:00,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:03:00,827 INFO L93 Difference]: Finished difference Result 457 states and 774 transitions. [2024-11-07 00:03:00,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:03:00,828 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 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 118 [2024-11-07 00:03:00,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:03:00,830 INFO L225 Difference]: With dead ends: 457 [2024-11-07 00:03:00,830 INFO L226 Difference]: Without dead ends: 365 [2024-11-07 00:03:00,833 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:03:00,834 INFO L432 NwaCegarLoop]: 467 mSDtfsCounter, 131 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 887 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:03:00,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 887 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:03:00,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2024-11-07 00:03:00,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 362. [2024-11-07 00:03:00,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 361 states have (on average 1.6759002770083102) internal successors, (605), 361 states have internal predecessors, (605), 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:03:00,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 605 transitions. [2024-11-07 00:03:00,866 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 605 transitions. Word has length 118 [2024-11-07 00:03:00,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:03:00,866 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 605 transitions. [2024-11-07 00:03:00,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 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:03:00,867 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 605 transitions. [2024-11-07 00:03:00,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-07 00:03:00,873 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:03:00,873 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] [2024-11-07 00:03:00,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 00:03:00,873 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:03:00,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:03:00,874 INFO L85 PathProgramCache]: Analyzing trace with hash -2086049744, now seen corresponding path program 1 times [2024-11-07 00:03:00,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:03:00,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137783886] [2024-11-07 00:03:00,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:03:00,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:03:00,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:03:01,112 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:03:01,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:03:01,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137783886] [2024-11-07 00:03:01,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137783886] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:03:01,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:03:01,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:03:01,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883691823] [2024-11-07 00:03:01,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:03:01,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:03:01,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:03:01,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:03:01,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:03:01,114 INFO L87 Difference]: Start difference. First operand 362 states and 605 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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:03:01,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:03:01,159 INFO L93 Difference]: Finished difference Result 684 states and 1157 transitions. [2024-11-07 00:03:01,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:03:01,160 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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 121 [2024-11-07 00:03:01,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:03:01,163 INFO L225 Difference]: With dead ends: 684 [2024-11-07 00:03:01,163 INFO L226 Difference]: Without dead ends: 514 [2024-11-07 00:03:01,164 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:03:01,165 INFO L432 NwaCegarLoop]: 470 mSDtfsCounter, 132 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 899 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:03:01,165 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 899 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:03:01,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2024-11-07 00:03:01,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 510. [2024-11-07 00:03:01,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 509 states have (on average 1.6836935166994107) internal successors, (857), 509 states have internal predecessors, (857), 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:03:01,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 857 transitions. [2024-11-07 00:03:01,192 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 857 transitions. Word has length 121 [2024-11-07 00:03:01,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:03:01,193 INFO L471 AbstractCegarLoop]: Abstraction has 510 states and 857 transitions. [2024-11-07 00:03:01,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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:03:01,194 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 857 transitions. [2024-11-07 00:03:01,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 00:03:01,196 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:03:01,196 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:03:01,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 00:03:01,197 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:03:01,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:03:01,199 INFO L85 PathProgramCache]: Analyzing trace with hash -623070795, now seen corresponding path program 1 times [2024-11-07 00:03:01,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:03:01,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147624052] [2024-11-07 00:03:01,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:03:01,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:03:01,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:03:01,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:03:01,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:03:01,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147624052] [2024-11-07 00:03:01,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147624052] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:03:01,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:03:01,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:03:01,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222764290] [2024-11-07 00:03:01,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:03:01,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:03:01,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:03:01,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:03:01,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:03:01,496 INFO L87 Difference]: Start difference. First operand 510 states and 857 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 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:03:01,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:03:01,549 INFO L93 Difference]: Finished difference Result 1110 states and 1879 transitions. [2024-11-07 00:03:01,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:03:01,550 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 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:03:01,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:03:01,555 INFO L225 Difference]: With dead ends: 1110 [2024-11-07 00:03:01,555 INFO L226 Difference]: Without dead ends: 792 [2024-11-07 00:03:01,557 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:03:01,558 INFO L432 NwaCegarLoop]: 470 mSDtfsCounter, 125 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 900 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:03:01,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 900 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:03:01,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2024-11-07 00:03:01,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 786. [2024-11-07 00:03:01,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 786 states, 785 states have (on average 1.6828025477707007) internal successors, (1321), 785 states have internal predecessors, (1321), 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:03:01,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 1321 transitions. [2024-11-07 00:03:01,592 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 1321 transitions. Word has length 124 [2024-11-07 00:03:01,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:03:01,593 INFO L471 AbstractCegarLoop]: Abstraction has 786 states and 1321 transitions. [2024-11-07 00:03:01,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 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:03:01,593 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 1321 transitions. [2024-11-07 00:03:01,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-07 00:03:01,595 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:03:01,595 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] [2024-11-07 00:03:01,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 00:03:01,596 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:03:01,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:03:01,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1603254571, now seen corresponding path program 1 times [2024-11-07 00:03:01,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:03:01,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596092610] [2024-11-07 00:03:01,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:03:01,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:03:01,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:03:01,824 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:03:01,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:03:01,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596092610] [2024-11-07 00:03:01,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596092610] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:03:01,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:03:01,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:03:01,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094064019] [2024-11-07 00:03:01,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:03:01,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:03:01,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:03:01,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:03:01,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:03:01,827 INFO L87 Difference]: Start difference. First operand 786 states and 1321 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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:03:01,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:03:01,883 INFO L93 Difference]: Finished difference Result 1902 states and 3203 transitions. [2024-11-07 00:03:01,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:03:01,884 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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 127 [2024-11-07 00:03:01,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:03:01,892 INFO L225 Difference]: With dead ends: 1902 [2024-11-07 00:03:01,893 INFO L226 Difference]: Without dead ends: 1308 [2024-11-07 00:03:01,895 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:03:01,896 INFO L432 NwaCegarLoop]: 470 mSDtfsCounter, 118 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 901 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:03:01,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 901 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:03:01,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2024-11-07 00:03:01,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 1298. [2024-11-07 00:03:01,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1298 states, 1297 states have (on average 1.6723207401696223) internal successors, (2169), 1297 states have internal predecessors, (2169), 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:03:01,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1298 states to 1298 states and 2169 transitions. [2024-11-07 00:03:01,946 INFO L78 Accepts]: Start accepts. Automaton has 1298 states and 2169 transitions. Word has length 127 [2024-11-07 00:03:01,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:03:01,950 INFO L471 AbstractCegarLoop]: Abstraction has 1298 states and 2169 transitions. [2024-11-07 00:03:01,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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:03:01,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1298 states and 2169 transitions. [2024-11-07 00:03:01,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-07 00:03:01,953 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:03:01,953 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:03:01,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 00:03:01,953 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:03:01,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:03:01,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1273370830, now seen corresponding path program 1 times [2024-11-07 00:03:01,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:03:01,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477334371] [2024-11-07 00:03:01,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:03:01,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:03:02,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:03:02,263 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:03:02,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:03:02,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477334371] [2024-11-07 00:03:02,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477334371] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:03:02,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:03:02,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:03:02,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823461181] [2024-11-07 00:03:02,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:03:02,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:03:02,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:03:02,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:03:02,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:03:02,266 INFO L87 Difference]: Start difference. First operand 1298 states and 2169 transitions. Second operand has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:03:02,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:03:02,623 INFO L93 Difference]: Finished difference Result 6530 states and 11093 transitions. [2024-11-07 00:03:02,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 00:03:02,624 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 130 [2024-11-07 00:03:02,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:03:02,651 INFO L225 Difference]: With dead ends: 6530 [2024-11-07 00:03:02,652 INFO L226 Difference]: Without dead ends: 5424 [2024-11-07 00:03:02,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-07 00:03:02,661 INFO L432 NwaCegarLoop]: 473 mSDtfsCounter, 1589 mSDsluCounter, 3043 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1589 SdHoareTripleChecker+Valid, 3516 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:03:02,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1589 Valid, 3516 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 00:03:02,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5424 states. [2024-11-07 00:03:02,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5424 to 2326. [2024-11-07 00:03:02,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2326 states, 2325 states have (on average 1.6748387096774193) internal successors, (3894), 2325 states have internal predecessors, (3894), 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:03:02,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2326 states to 2326 states and 3894 transitions. [2024-11-07 00:03:02,798 INFO L78 Accepts]: Start accepts. Automaton has 2326 states and 3894 transitions. Word has length 130 [2024-11-07 00:03:02,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:03:02,799 INFO L471 AbstractCegarLoop]: Abstraction has 2326 states and 3894 transitions. [2024-11-07 00:03:02,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:03:02,799 INFO L276 IsEmpty]: Start isEmpty. Operand 2326 states and 3894 transitions. [2024-11-07 00:03:02,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-07 00:03:02,802 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:03:02,802 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:03:02,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 00:03:02,803 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:03:02,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:03:02,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1274816655, now seen corresponding path program 1 times [2024-11-07 00:03:02,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:03:02,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736488986] [2024-11-07 00:03:02,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:03:02,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:03:02,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:03:03,020 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:03:03,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:03:03,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736488986] [2024-11-07 00:03:03,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736488986] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:03:03,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:03:03,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:03:03,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480697776] [2024-11-07 00:03:03,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:03:03,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:03:03,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:03:03,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:03:03,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:03:03,022 INFO L87 Difference]: Start difference. First operand 2326 states and 3894 transitions. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 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:03:03,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:03:03,185 INFO L93 Difference]: Finished difference Result 6744 states and 11406 transitions. [2024-11-07 00:03:03,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:03:03,185 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 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:03:03,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:03:03,206 INFO L225 Difference]: With dead ends: 6744 [2024-11-07 00:03:03,207 INFO L226 Difference]: Without dead ends: 4610 [2024-11-07 00:03:03,213 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:03:03,213 INFO L432 NwaCegarLoop]: 473 mSDtfsCounter, 457 mSDsluCounter, 931 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 1404 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:03:03,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 1404 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:03:03,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4610 states. [2024-11-07 00:03:03,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4610 to 3451. [2024-11-07 00:03:03,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3451 states, 3450 states have (on average 1.6805797101449276) internal successors, (5798), 3450 states have internal predecessors, (5798), 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:03:03,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3451 states to 3451 states and 5798 transitions. [2024-11-07 00:03:03,347 INFO L78 Accepts]: Start accepts. Automaton has 3451 states and 5798 transitions. Word has length 131 [2024-11-07 00:03:03,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:03:03,347 INFO L471 AbstractCegarLoop]: Abstraction has 3451 states and 5798 transitions. [2024-11-07 00:03:03,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 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:03:03,348 INFO L276 IsEmpty]: Start isEmpty. Operand 3451 states and 5798 transitions. [2024-11-07 00:03:03,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-07 00:03:03,351 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:03:03,351 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:03:03,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 00:03:03,352 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:03:03,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:03:03,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1504754277, now seen corresponding path program 1 times [2024-11-07 00:03:03,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:03:03,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919362340] [2024-11-07 00:03:03,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:03:03,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:03:03,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:03:03,586 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:03:03,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:03:03,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919362340] [2024-11-07 00:03:03,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919362340] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:03:03,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:03:03,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:03:03,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690655831] [2024-11-07 00:03:03,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:03:03,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:03:03,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:03:03,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:03:03,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:03:03,589 INFO L87 Difference]: Start difference. First operand 3451 states and 5798 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 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:03:03,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:03:03,834 INFO L93 Difference]: Finished difference Result 10068 states and 17008 transitions. [2024-11-07 00:03:03,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:03:03,835 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 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:03:03,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:03:03,865 INFO L225 Difference]: With dead ends: 10068 [2024-11-07 00:03:03,865 INFO L226 Difference]: Without dead ends: 6809 [2024-11-07 00:03:03,874 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:03:03,875 INFO L432 NwaCegarLoop]: 461 mSDtfsCounter, 457 mSDsluCounter, 963 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 1424 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:03:03,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 1424 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:03:03,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6809 states. [2024-11-07 00:03:04,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6809 to 5106. [2024-11-07 00:03:04,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5106 states, 5105 states have (on average 1.6789422135161607) internal successors, (8571), 5105 states have internal predecessors, (8571), 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:03:04,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5106 states to 5106 states and 8571 transitions. [2024-11-07 00:03:04,106 INFO L78 Accepts]: Start accepts. Automaton has 5106 states and 8571 transitions. Word has length 132 [2024-11-07 00:03:04,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:03:04,107 INFO L471 AbstractCegarLoop]: Abstraction has 5106 states and 8571 transitions. [2024-11-07 00:03:04,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 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:03:04,107 INFO L276 IsEmpty]: Start isEmpty. Operand 5106 states and 8571 transitions. [2024-11-07 00:03:04,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-07 00:03:04,112 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:03:04,112 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:03:04,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 00:03:04,112 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:03:04,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:03:04,113 INFO L85 PathProgramCache]: Analyzing trace with hash -557803383, now seen corresponding path program 1 times [2024-11-07 00:03:04,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:03:04,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66186390] [2024-11-07 00:03:04,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:03:04,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:03:04,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:03:04,248 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:03:04,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:03:04,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66186390] [2024-11-07 00:03:04,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66186390] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:03:04,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:03:04,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:03:04,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125022358] [2024-11-07 00:03:04,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:03:04,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:03:04,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:03:04,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:03:04,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:03:04,250 INFO L87 Difference]: Start difference. First operand 5106 states and 8571 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 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:03:04,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:03:04,380 INFO L93 Difference]: Finished difference Result 11425 states and 19299 transitions. [2024-11-07 00:03:04,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:03:04,381 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 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 133 [2024-11-07 00:03:04,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:03:04,425 INFO L225 Difference]: With dead ends: 11425 [2024-11-07 00:03:04,425 INFO L226 Difference]: Without dead ends: 7909 [2024-11-07 00:03:04,434 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:03:04,435 INFO L432 NwaCegarLoop]: 592 mSDtfsCounter, 138 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 1043 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:03:04,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 1043 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:03:04,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7909 states. [2024-11-07 00:03:04,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7909 to 7907. [2024-11-07 00:03:04,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7907 states, 7906 states have (on average 1.6750569187958513) internal successors, (13243), 7906 states have internal predecessors, (13243), 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:03:04,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7907 states to 7907 states and 13243 transitions. [2024-11-07 00:03:04,712 INFO L78 Accepts]: Start accepts. Automaton has 7907 states and 13243 transitions. Word has length 133 [2024-11-07 00:03:04,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:03:04,712 INFO L471 AbstractCegarLoop]: Abstraction has 7907 states and 13243 transitions. [2024-11-07 00:03:04,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 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:03:04,713 INFO L276 IsEmpty]: Start isEmpty. Operand 7907 states and 13243 transitions. [2024-11-07 00:03:04,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-07 00:03:04,715 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:03:04,715 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:03:04,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 00:03:04,716 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:03:04,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:03:04,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1941111592, now seen corresponding path program 1 times [2024-11-07 00:03:04,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:03:04,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341253927] [2024-11-07 00:03:04,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:03:04,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:03:04,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:03:04,922 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:03:04,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:03:04,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341253927] [2024-11-07 00:03:04,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341253927] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:03:04,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:03:04,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:03:04,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835582546] [2024-11-07 00:03:04,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:03:04,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:03:04,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:03:04,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:03:04,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:03:04,924 INFO L87 Difference]: Start difference. First operand 7907 states and 13243 transitions. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 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:03:05,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:03:05,236 INFO L93 Difference]: Finished difference Result 23494 states and 39550 transitions. [2024-11-07 00:03:05,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:03:05,237 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 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 133 [2024-11-07 00:03:05,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:03:05,288 INFO L225 Difference]: With dead ends: 23494 [2024-11-07 00:03:05,288 INFO L226 Difference]: Without dead ends: 15781 [2024-11-07 00:03:05,305 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:03:05,306 INFO L432 NwaCegarLoop]: 477 mSDtfsCounter, 455 mSDsluCounter, 1041 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 1518 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:03:05,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 1518 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:03:05,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15781 states. [2024-11-07 00:03:05,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15781 to 11788. [2024-11-07 00:03:05,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11788 states, 11787 states have (on average 1.6726054127428522) internal successors, (19715), 11787 states have internal predecessors, (19715), 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:03:05,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11788 states to 11788 states and 19715 transitions. [2024-11-07 00:03:05,714 INFO L78 Accepts]: Start accepts. Automaton has 11788 states and 19715 transitions. Word has length 133 [2024-11-07 00:03:05,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:03:05,714 INFO L471 AbstractCegarLoop]: Abstraction has 11788 states and 19715 transitions. [2024-11-07 00:03:05,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 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:03:05,715 INFO L276 IsEmpty]: Start isEmpty. Operand 11788 states and 19715 transitions. [2024-11-07 00:03:05,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-07 00:03:05,717 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:03:05,718 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:03:05,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 00:03:05,718 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:03:05,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:03:05,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1631061960, now seen corresponding path program 1 times [2024-11-07 00:03:05,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:03:05,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255032977] [2024-11-07 00:03:05,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:03:05,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:03:05,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:03:05,873 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:03:05,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:03:05,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255032977] [2024-11-07 00:03:05,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255032977] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:03:05,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:03:05,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:03:05,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961872497] [2024-11-07 00:03:05,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:03:05,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:03:05,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:03:05,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:03:05,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:03:05,878 INFO L87 Difference]: Start difference. First operand 11788 states and 19715 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 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:03:06,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:03:06,153 INFO L93 Difference]: Finished difference Result 23685 states and 39649 transitions. [2024-11-07 00:03:06,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:03:06,154 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 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 133 [2024-11-07 00:03:06,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:03:06,201 INFO L225 Difference]: With dead ends: 23685 [2024-11-07 00:03:06,201 INFO L226 Difference]: Without dead ends: 17075 [2024-11-07 00:03:06,219 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:03:06,220 INFO L432 NwaCegarLoop]: 531 mSDtfsCounter, 117 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 985 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:03:06,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 985 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:03:06,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17075 states. [2024-11-07 00:03:06,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17075 to 17073. [2024-11-07 00:03:06,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17073 states, 17072 states have (on average 1.6617268041237114) internal successors, (28369), 17072 states have internal predecessors, (28369), 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:03:06,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17073 states to 17073 states and 28369 transitions. [2024-11-07 00:03:06,740 INFO L78 Accepts]: Start accepts. Automaton has 17073 states and 28369 transitions. Word has length 133 [2024-11-07 00:03:06,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:03:06,741 INFO L471 AbstractCegarLoop]: Abstraction has 17073 states and 28369 transitions. [2024-11-07 00:03:06,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 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:03:06,741 INFO L276 IsEmpty]: Start isEmpty. Operand 17073 states and 28369 transitions. [2024-11-07 00:03:06,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-07 00:03:06,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:03:06,743 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:03:06,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 00:03:06,744 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:03:06,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:03:06,745 INFO L85 PathProgramCache]: Analyzing trace with hash -15643545, now seen corresponding path program 1 times [2024-11-07 00:03:06,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:03:06,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205420974] [2024-11-07 00:03:06,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:03:06,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:03:06,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:03:06,861 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:03:06,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:03:06,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205420974] [2024-11-07 00:03:06,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205420974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:03:06,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:03:06,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:03:06,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131415090] [2024-11-07 00:03:06,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:03:06,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:03:06,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:03:06,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:03:06,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:03:06,863 INFO L87 Difference]: Start difference. First operand 17073 states and 28369 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 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:03:07,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:03:07,333 INFO L93 Difference]: Finished difference Result 38023 states and 63245 transitions. [2024-11-07 00:03:07,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:03:07,334 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 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 133 [2024-11-07 00:03:07,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:03:07,413 INFO L225 Difference]: With dead ends: 38023 [2024-11-07 00:03:07,413 INFO L226 Difference]: Without dead ends: 26128 [2024-11-07 00:03:07,438 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:03:07,440 INFO L432 NwaCegarLoop]: 560 mSDtfsCounter, 124 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 1013 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:03:07,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 1013 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:03:07,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26128 states. [2024-11-07 00:03:08,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26128 to 26126. [2024-11-07 00:03:08,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26126 states, 26125 states have (on average 1.6492631578947368) internal successors, (43087), 26125 states have internal predecessors, (43087), 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:03:08,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26126 states to 26126 states and 43087 transitions. [2024-11-07 00:03:08,135 INFO L78 Accepts]: Start accepts. Automaton has 26126 states and 43087 transitions. Word has length 133 [2024-11-07 00:03:08,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:03:08,135 INFO L471 AbstractCegarLoop]: Abstraction has 26126 states and 43087 transitions. [2024-11-07 00:03:08,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 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:03:08,135 INFO L276 IsEmpty]: Start isEmpty. Operand 26126 states and 43087 transitions. [2024-11-07 00:03:08,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-07 00:03:08,137 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:03:08,137 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:03:08,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 00:03:08,137 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:03:08,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:03:08,137 INFO L85 PathProgramCache]: Analyzing trace with hash 2123016934, now seen corresponding path program 1 times [2024-11-07 00:03:08,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:03:08,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861610527] [2024-11-07 00:03:08,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:03:08,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:03:08,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:03:08,341 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:03:08,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:03:08,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861610527] [2024-11-07 00:03:08,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861610527] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:03:08,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:03:08,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:03:08,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611818651] [2024-11-07 00:03:08,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:03:08,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:03:08,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:03:08,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:03:08,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:03:08,344 INFO L87 Difference]: Start difference. First operand 26126 states and 43087 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 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:03:08,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:03:08,971 INFO L93 Difference]: Finished difference Result 58253 states and 96104 transitions. [2024-11-07 00:03:08,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:03:08,972 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 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 133 [2024-11-07 00:03:08,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:03:09,089 INFO L225 Difference]: With dead ends: 58253 [2024-11-07 00:03:09,089 INFO L226 Difference]: Without dead ends: 39892 [2024-11-07 00:03:09,137 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:03:09,138 INFO L432 NwaCegarLoop]: 590 mSDtfsCounter, 131 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 1042 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:03:09,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 1042 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:03:09,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39892 states. [2024-11-07 00:03:09,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39892 to 39890. [2024-11-07 00:03:10,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39890 states, 39889 states have (on average 1.633708541201835) internal successors, (65167), 39889 states have internal predecessors, (65167), 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:03:10,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39890 states to 39890 states and 65167 transitions. [2024-11-07 00:03:10,136 INFO L78 Accepts]: Start accepts. Automaton has 39890 states and 65167 transitions. Word has length 133 [2024-11-07 00:03:10,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:03:10,136 INFO L471 AbstractCegarLoop]: Abstraction has 39890 states and 65167 transitions. [2024-11-07 00:03:10,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 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:03:10,137 INFO L276 IsEmpty]: Start isEmpty. Operand 39890 states and 65167 transitions. [2024-11-07 00:03:10,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 00:03:10,138 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:03:10,138 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:03:10,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 00:03:10,138 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:03:10,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:03:10,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1542676484, now seen corresponding path program 1 times [2024-11-07 00:03:10,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:03:10,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859180020] [2024-11-07 00:03:10,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:03:10,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:03:10,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:03:10,322 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:03:10,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:03:10,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859180020] [2024-11-07 00:03:10,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859180020] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:03:10,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:03:10,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:03:10,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195689218] [2024-11-07 00:03:10,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:03:10,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:03:10,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:03:10,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:03:10,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:03:10,325 INFO L87 Difference]: Start difference. First operand 39890 states and 65167 transitions. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:03:11,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:03:11,543 INFO L93 Difference]: Finished difference Result 129245 states and 211740 transitions. [2024-11-07 00:03:11,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:03:11,544 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2024-11-07 00:03:11,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:03:11,834 INFO L225 Difference]: With dead ends: 129245 [2024-11-07 00:03:11,834 INFO L226 Difference]: Without dead ends: 89570 [2024-11-07 00:03:11,879 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:03:11,880 INFO L432 NwaCegarLoop]: 462 mSDtfsCounter, 453 mSDsluCounter, 1043 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 1505 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:03:11,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 1505 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:03:11,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89570 states. [2024-11-07 00:03:13,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89570 to 64505. [2024-11-07 00:03:13,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64505 states, 64504 states have (on average 1.626658811856629) internal successors, (104926), 64504 states have internal predecessors, (104926), 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:03:13,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64505 states to 64505 states and 104926 transitions. [2024-11-07 00:03:13,664 INFO L78 Accepts]: Start accepts. Automaton has 64505 states and 104926 transitions. Word has length 134 [2024-11-07 00:03:13,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:03:13,665 INFO L471 AbstractCegarLoop]: Abstraction has 64505 states and 104926 transitions. [2024-11-07 00:03:13,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:03:13,665 INFO L276 IsEmpty]: Start isEmpty. Operand 64505 states and 104926 transitions. [2024-11-07 00:03:13,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-07 00:03:13,666 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:03:13,666 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:03:13,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 00:03:13,667 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:03:13,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:03:13,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1330430292, now seen corresponding path program 1 times [2024-11-07 00:03:13,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:03:13,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147807043] [2024-11-07 00:03:13,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:03:13,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:03:13,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:03:14,035 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:03:14,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:03:14,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147807043] [2024-11-07 00:03:14,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147807043] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:03:14,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:03:14,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:03:14,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936885574] [2024-11-07 00:03:14,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:03:14,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:03:14,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:03:14,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:03:14,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:03:14,037 INFO L87 Difference]: Start difference. First operand 64505 states and 104926 transitions. Second operand has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:03:15,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:03:15,329 INFO L93 Difference]: Finished difference Result 128797 states and 209509 transitions. [2024-11-07 00:03:15,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:03:15,330 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 136 [2024-11-07 00:03:15,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:03:15,471 INFO L225 Difference]: With dead ends: 128797 [2024-11-07 00:03:15,472 INFO L226 Difference]: Without dead ends: 64507 [2024-11-07 00:03:15,510 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:03:15,512 INFO L432 NwaCegarLoop]: 469 mSDtfsCounter, 479 mSDsluCounter, 1311 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 1780 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:03:15,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 1780 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:03:15,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64507 states. [2024-11-07 00:03:16,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64507 to 64505. [2024-11-07 00:03:16,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64505 states, 64504 states have (on average 1.6169694902641696) internal successors, (104301), 64504 states have internal predecessors, (104301), 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:03:16,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64505 states to 64505 states and 104301 transitions. [2024-11-07 00:03:16,998 INFO L78 Accepts]: Start accepts. Automaton has 64505 states and 104301 transitions. Word has length 136 [2024-11-07 00:03:16,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:03:16,998 INFO L471 AbstractCegarLoop]: Abstraction has 64505 states and 104301 transitions. [2024-11-07 00:03:16,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:03:16,999 INFO L276 IsEmpty]: Start isEmpty. Operand 64505 states and 104301 transitions. [2024-11-07 00:03:17,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-07 00:03:17,001 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:03:17,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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:03:17,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 00:03:17,001 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:03:17,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:03:17,003 INFO L85 PathProgramCache]: Analyzing trace with hash -156781653, now seen corresponding path program 1 times [2024-11-07 00:03:17,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:03:17,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087838081] [2024-11-07 00:03:17,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:03:17,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:03:17,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:03:17,365 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:03:17,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:03:17,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087838081] [2024-11-07 00:03:17,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087838081] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:03:17,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:03:17,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:03:17,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553524898] [2024-11-07 00:03:17,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:03:17,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:03:17,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:03:17,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:03:17,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:03:17,367 INFO L87 Difference]: Start difference. First operand 64505 states and 104301 transitions. Second operand has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 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:03:18,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:03:18,786 INFO L93 Difference]: Finished difference Result 188667 states and 305529 transitions. [2024-11-07 00:03:18,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:03:18,787 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 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 139 [2024-11-07 00:03:18,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:03:19,083 INFO L225 Difference]: With dead ends: 188667 [2024-11-07 00:03:19,083 INFO L226 Difference]: Without dead ends: 124377 [2024-11-07 00:03:19,148 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:03:19,149 INFO L432 NwaCegarLoop]: 462 mSDtfsCounter, 471 mSDsluCounter, 1329 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 1791 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:03:19,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 1791 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 00:03:19,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124377 states. [2024-11-07 00:03:21,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124377 to 124375. [2024-11-07 00:03:21,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124375 states, 124374 states have (on average 1.6044671715953496) internal successors, (199554), 124374 states have internal predecessors, (199554), 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:03:21,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124375 states to 124375 states and 199554 transitions. [2024-11-07 00:03:21,576 INFO L78 Accepts]: Start accepts. Automaton has 124375 states and 199554 transitions. Word has length 139 [2024-11-07 00:03:21,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:03:21,576 INFO L471 AbstractCegarLoop]: Abstraction has 124375 states and 199554 transitions. [2024-11-07 00:03:21,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 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:03:21,576 INFO L276 IsEmpty]: Start isEmpty. Operand 124375 states and 199554 transitions. [2024-11-07 00:03:21,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-07 00:03:21,577 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:03:21,577 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:03:21,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 00:03:21,577 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:03:21,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:03:21,578 INFO L85 PathProgramCache]: Analyzing trace with hash -996609347, now seen corresponding path program 1 times [2024-11-07 00:03:21,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:03:21,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084089749] [2024-11-07 00:03:21,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:03:21,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:03:21,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:03:22,497 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:03:22,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:03:22,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084089749] [2024-11-07 00:03:22,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084089749] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:03:22,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:03:22,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:03:22,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102781556] [2024-11-07 00:03:22,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:03:22,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 00:03:22,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:03:22,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 00:03:22,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:03:22,498 INFO L87 Difference]: Start difference. First operand 124375 states and 199554 transitions. Second operand has 8 states, 8 states have (on average 17.5) internal successors, (140), 8 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:03:23,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:03:23,673 INFO L93 Difference]: Finished difference Result 130185 states and 207299 transitions. [2024-11-07 00:03:23,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 00:03:23,673 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 17.5) internal successors, (140), 8 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 140 [2024-11-07 00:03:23,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:03:24,142 INFO L225 Difference]: With dead ends: 130185 [2024-11-07 00:03:24,143 INFO L226 Difference]: Without dead ends: 130183 [2024-11-07 00:03:24,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:03:24,180 INFO L432 NwaCegarLoop]: 467 mSDtfsCounter, 0 mSDsluCounter, 2783 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3250 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:03:24,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3250 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:03:24,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130183 states. [2024-11-07 00:03:25,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130183 to 130183. [2024-11-07 00:03:26,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130183 states, 130182 states have (on average 1.5772917914919113) internal successors, (205335), 130182 states have internal predecessors, (205335), 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:03:26,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130183 states to 130183 states and 205335 transitions. [2024-11-07 00:03:26,596 INFO L78 Accepts]: Start accepts. Automaton has 130183 states and 205335 transitions. Word has length 140 [2024-11-07 00:03:26,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:03:26,596 INFO L471 AbstractCegarLoop]: Abstraction has 130183 states and 205335 transitions. [2024-11-07 00:03:26,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.5) internal successors, (140), 8 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:03:26,597 INFO L276 IsEmpty]: Start isEmpty. Operand 130183 states and 205335 transitions. [2024-11-07 00:03:26,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-07 00:03:26,601 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:03:26,601 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:03:26,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 00:03:26,602 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:03:26,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:03:26,602 INFO L85 PathProgramCache]: Analyzing trace with hash -275580262, now seen corresponding path program 1 times [2024-11-07 00:03:26,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:03:26,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977406840] [2024-11-07 00:03:26,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:03:26,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:03:26,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:03:26,723 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:03:26,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:03:26,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977406840] [2024-11-07 00:03:26,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977406840] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:03:26,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:03:26,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:03:26,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234690398] [2024-11-07 00:03:26,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:03:26,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:03:26,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:03:26,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:03:26,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:03:26,725 INFO L87 Difference]: Start difference. First operand 130183 states and 205335 transitions. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 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:03:29,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:03:29,447 INFO L93 Difference]: Finished difference Result 389528 states and 613982 transitions. [2024-11-07 00:03:29,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:03:29,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 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 177 [2024-11-07 00:03:29,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:03:29,936 INFO L225 Difference]: With dead ends: 389528 [2024-11-07 00:03:29,936 INFO L226 Difference]: Without dead ends: 259404 [2024-11-07 00:03:30,044 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:03:30,045 INFO L432 NwaCegarLoop]: 733 mSDtfsCounter, 349 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 1190 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:03:30,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 1190 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:03:30,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259404 states. [2024-11-07 00:03:34,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259404 to 259402. [2024-11-07 00:03:34,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259402 states, 259401 states have (on average 1.567040990589859) internal successors, (406492), 259401 states have internal predecessors, (406492), 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:03:35,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259402 states to 259402 states and 406492 transitions. [2024-11-07 00:03:35,053 INFO L78 Accepts]: Start accepts. Automaton has 259402 states and 406492 transitions. Word has length 177 [2024-11-07 00:03:35,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:03:35,053 INFO L471 AbstractCegarLoop]: Abstraction has 259402 states and 406492 transitions. [2024-11-07 00:03:35,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 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:03:35,053 INFO L276 IsEmpty]: Start isEmpty. Operand 259402 states and 406492 transitions. [2024-11-07 00:03:35,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-07 00:03:35,069 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:03:35,070 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:03:35,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 00:03:35,070 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:03:35,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:03:35,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1913285081, now seen corresponding path program 1 times [2024-11-07 00:03:35,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:03:35,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223929716] [2024-11-07 00:03:35,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:03:35,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:03:35,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:03:35,196 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-07 00:03:35,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:03:35,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223929716] [2024-11-07 00:03:35,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223929716] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:03:35,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:03:35,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:03:35,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273887508] [2024-11-07 00:03:35,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:03:35,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:03:35,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:03:35,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:03:35,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:03:35,198 INFO L87 Difference]: Start difference. First operand 259402 states and 406492 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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:03:40,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:03:40,693 INFO L93 Difference]: Finished difference Result 776268 states and 1215619 transitions. [2024-11-07 00:03:40,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:03:40,694 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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 177 [2024-11-07 00:03:40,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:03:42,436 INFO L225 Difference]: With dead ends: 776268 [2024-11-07 00:03:42,436 INFO L226 Difference]: Without dead ends: 516929 [2024-11-07 00:03:42,605 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:03:42,606 INFO L432 NwaCegarLoop]: 737 mSDtfsCounter, 351 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 1194 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:03:42,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 1194 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:03:42,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516929 states.