./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/systemc/token_ring.01.cil-1.c --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for overflows
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/systemc/token_ring.01.cil-1.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-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 ! overflow) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '7b0a21004c99a1cc1588d43a2481960a2ce9f2cdf68e9a363306433e7d24bd30']
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/systemc/token_ring.01.cil-1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-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 ! overflow) )
--witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7b0a21004c99a1cc1588d43a2481960a2ce9f2cdf68e9a363306433e7d24bd30
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-4f9af40
[2024-11-07 20:59:40,242 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-07 20:59:40,309 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf
[2024-11-07 20:59:40,315 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-07 20:59:40,316 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-07 20:59:40,333 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-07 20:59:40,333 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-07 20:59:40,334 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-07 20:59:40,334 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-07 20:59:40,334 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-07 20:59:40,334 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-07 20:59:40,334 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-07 20:59:40,335 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-07 20:59:40,335 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-07 20:59:40,335 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-07 20:59:40,335 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-07 20:59:40,335 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-07 20:59:40,335 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-07 20:59:40,336 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-07 20:59:40,336 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-07 20:59:40,336 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-07 20:59:40,336 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-07 20:59:40,336 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-07 20:59:40,336 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-07 20:59:40,336 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-07 20:59:40,336 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME
[2024-11-07 20:59:40,337 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false
[2024-11-07 20:59:40,337 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-07 20:59:40,337 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-07 20:59:40,337 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-07 20:59:40,337 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-07 20:59:40,337 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-07 20:59:40,337 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-07 20:59:40,337 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-07 20:59:40,338 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 20:59:40,338 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-07 20:59:40,338 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-07 20:59:40,338 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-07 20:59:40,338 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-07 20:59:40,338 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-07 20:59:40,338 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-07 20:59:40,338 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-07 20:59:40,339 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-07 20:59:40,339 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-07 20:59:40,339 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 ! overflow) )
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 -> 7b0a21004c99a1cc1588d43a2481960a2ce9f2cdf68e9a363306433e7d24bd30
[2024-11-07 20:59:40,619 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-07 20:59:40,626 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-07 20:59:40,628 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-07 20:59:40,629 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-07 20:59:40,630 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-07 20:59:40,631 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.01.cil-1.c
[2024-11-07 20:59:41,867 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-07 20:59:42,110 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-07 20:59:42,111 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.01.cil-1.c
[2024-11-07 20:59:42,122 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2563ba637/bf5793feb4df44a5a9081d39e1b9ac79/FLAG963d8a7bb
[2024-11-07 20:59:42,428 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2563ba637/bf5793feb4df44a5a9081d39e1b9ac79
[2024-11-07 20:59:42,430 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-07 20:59:42,432 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-07 20:59:42,433 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-07 20:59:42,433 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-07 20:59:42,437 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-07 20:59:42,438 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:59:42" (1/1) ...
[2024-11-07 20:59:42,438 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45710d71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:59:42, skipping insertion in model container
[2024-11-07 20:59:42,438 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:59:42" (1/1) ...
[2024-11-07 20:59:42,462 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-07 20:59:42,603 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 20:59:42,616 INFO L200 MainTranslator]: Completed pre-run
[2024-11-07 20:59:42,640 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 20:59:42,658 INFO L204 MainTranslator]: Completed translation
[2024-11-07 20:59:42,659 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:59:42 WrapperNode
[2024-11-07 20:59:42,659 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-07 20:59:42,660 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-07 20:59:42,660 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-07 20:59:42,660 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-07 20:59:42,664 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:59:42" (1/1) ...
[2024-11-07 20:59:42,669 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:59:42" (1/1) ...
[2024-11-07 20:59:42,688 INFO L138 Inliner]: procedures = 30, calls = 35, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 224
[2024-11-07 20:59:42,688 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-07 20:59:42,689 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-07 20:59:42,689 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-07 20:59:42,689 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-07 20:59:42,699 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:59:42" (1/1) ...
[2024-11-07 20:59:42,699 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:59:42" (1/1) ...
[2024-11-07 20:59:42,701 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:59:42" (1/1) ...
[2024-11-07 20:59:42,722 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 20:59:42,722 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:59:42" (1/1) ...
[2024-11-07 20:59:42,722 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:59:42" (1/1) ...
[2024-11-07 20:59:42,730 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:59:42" (1/1) ...
[2024-11-07 20:59:42,738 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:59:42" (1/1) ...
[2024-11-07 20:59:42,740 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:59:42" (1/1) ...
[2024-11-07 20:59:42,740 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:59:42" (1/1) ...
[2024-11-07 20:59:42,745 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-07 20:59:42,746 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-07 20:59:42,746 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-07 20:59:42,746 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-07 20:59:42,747 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:59:42" (1/1) ...
[2024-11-07 20:59:42,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 20:59:42,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 20:59:42,784 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 20:59:42,786 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 20:59:42,806 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-07 20:59:42,807 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events
[2024-11-07 20:59:42,808 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events
[2024-11-07 20:59:42,808 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads
[2024-11-07 20:59:42,808 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads
[2024-11-07 20:59:42,808 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify
[2024-11-07 20:59:42,808 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify
[2024-11-07 20:59:42,808 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread
[2024-11-07 20:59:42,808 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread
[2024-11-07 20:59:42,809 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events
[2024-11-07 20:59:42,809 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events
[2024-11-07 20:59:42,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-07 20:59:42,809 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels
[2024-11-07 20:59:42,809 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels
[2024-11-07 20:59:42,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-07 20:59:42,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-07 20:59:42,874 INFO L238 CfgBuilder]: Building ICFG
[2024-11-07 20:59:42,875 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-07 20:59:43,121 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live.
[2024-11-07 20:59:43,121 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-07 20:59:43,134 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-07 20:59:43,134 INFO L316 CfgBuilder]: Removed 4 assume(true) statements.
[2024-11-07 20:59:43,136 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:59:43 BoogieIcfgContainer
[2024-11-07 20:59:43,136 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-07 20:59:43,138 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-07 20:59:43,138 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-07 20:59:43,143 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-07 20:59:43,143 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:59:42" (1/3) ...
[2024-11-07 20:59:43,143 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fb3e6dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:59:43, skipping insertion in model container
[2024-11-07 20:59:43,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:59:42" (2/3) ...
[2024-11-07 20:59:43,144 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fb3e6dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:59:43, skipping insertion in model container
[2024-11-07 20:59:43,145 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:59:43" (3/3) ...
[2024-11-07 20:59:43,146 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-1.c
[2024-11-07 20:59:43,158 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-07 20:59:43,159 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations.
[2024-11-07 20:59:43,236 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-07 20:59:43,247 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;@6ee52252, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-07 20:59:43,247 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations.
[2024-11-07 20:59:43,251 INFO L276 IsEmpty]: Start isEmpty. Operand has 116 states, 90 states have (on average 1.5222222222222221) internal successors, (137), 95 states have internal predecessors, (137), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15)
[2024-11-07 20:59:43,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56
[2024-11-07 20:59:43,258 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 20:59:43,258 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]
[2024-11-07 20:59:43,259 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] ===
[2024-11-07 20:59:43,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 20:59:43,262 INFO L85 PathProgramCache]: Analyzing trace with hash -507947728, now seen corresponding path program 1 times
[2024-11-07 20:59:43,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 20:59:43,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46527714]
[2024-11-07 20:59:43,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 20:59:43,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 20:59:43,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:43,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3
[2024-11-07 20:59:43,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:43,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 20:59:43,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:43,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17
[2024-11-07 20:59:43,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:43,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 20:59:43,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:43,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42
[2024-11-07 20:59:43,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:43,692 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 20:59:43,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 20:59:43,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46527714]
[2024-11-07 20:59:43,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46527714] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 20:59:43,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 20:59:43,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-07 20:59:43,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784742555]
[2024-11-07 20:59:43,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 20:59:43,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-07 20:59:43,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 20:59:43,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-07 20:59:43,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-11-07 20:59:43,723 INFO L87 Difference]: Start difference. First operand has 116 states, 90 states have (on average 1.5222222222222221) internal successors, (137), 95 states have internal predecessors, (137), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)
[2024-11-07 20:59:44,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 20:59:44,448 INFO L93 Difference]: Finished difference Result 364 states and 536 transitions.
[2024-11-07 20:59:44,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-11-07 20:59:44,451 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55
[2024-11-07 20:59:44,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 20:59:44,463 INFO L225 Difference]: With dead ends: 364
[2024-11-07 20:59:44,464 INFO L226 Difference]: Without dead ends: 247
[2024-11-07 20:59:44,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110
[2024-11-07 20:59:44,470 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 309 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2024-11-07 20:59:44,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 423 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2024-11-07 20:59:44,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states.
[2024-11-07 20:59:44,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 204.
[2024-11-07 20:59:44,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 162 states have (on average 1.4444444444444444) internal successors, (234), 167 states have internal predecessors, (234), 25 states have call successors, (25), 12 states have call predecessors, (25), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28)
[2024-11-07 20:59:44,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 287 transitions.
[2024-11-07 20:59:44,535 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 287 transitions. Word has length 55
[2024-11-07 20:59:44,535 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 20:59:44,535 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 287 transitions.
[2024-11-07 20:59:44,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)
[2024-11-07 20:59:44,536 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 287 transitions.
[2024-11-07 20:59:44,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56
[2024-11-07 20:59:44,537 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 20:59:44,537 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]
[2024-11-07 20:59:44,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-07 20:59:44,538 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] ===
[2024-11-07 20:59:44,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 20:59:44,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1956486444, now seen corresponding path program 1 times
[2024-11-07 20:59:44,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 20:59:44,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509696652]
[2024-11-07 20:59:44,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 20:59:44,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 20:59:44,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:44,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3
[2024-11-07 20:59:44,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:44,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 20:59:44,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:44,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17
[2024-11-07 20:59:44,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:44,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 20:59:44,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:44,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42
[2024-11-07 20:59:44,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:44,725 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 20:59:44,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 20:59:44,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509696652]
[2024-11-07 20:59:44,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509696652] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 20:59:44,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 20:59:44,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-11-07 20:59:44,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044830947]
[2024-11-07 20:59:44,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 20:59:44,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-07 20:59:44,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 20:59:44,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-07 20:59:44,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2024-11-07 20:59:44,728 INFO L87 Difference]: Start difference. First operand 204 states and 287 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)
[2024-11-07 20:59:45,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 20:59:45,506 INFO L93 Difference]: Finished difference Result 555 states and 783 transitions.
[2024-11-07 20:59:45,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2024-11-07 20:59:45,506 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55
[2024-11-07 20:59:45,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 20:59:45,510 INFO L225 Difference]: With dead ends: 555
[2024-11-07 20:59:45,513 INFO L226 Difference]: Without dead ends: 360
[2024-11-07 20:59:45,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240
[2024-11-07 20:59:45,518 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 293 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2024-11-07 20:59:45,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 700 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2024-11-07 20:59:45,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states.
[2024-11-07 20:59:45,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 294.
[2024-11-07 20:59:45,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 235 states have (on average 1.4340425531914893) internal successors, (337), 241 states have internal predecessors, (337), 35 states have call successors, (35), 18 states have call predecessors, (35), 20 states have return successors, (40), 36 states have call predecessors, (40), 35 states have call successors, (40)
[2024-11-07 20:59:45,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 412 transitions.
[2024-11-07 20:59:45,573 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 412 transitions. Word has length 55
[2024-11-07 20:59:45,573 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 20:59:45,574 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 412 transitions.
[2024-11-07 20:59:45,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)
[2024-11-07 20:59:45,574 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 412 transitions.
[2024-11-07 20:59:45,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56
[2024-11-07 20:59:45,576 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 20:59:45,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]
[2024-11-07 20:59:45,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-07 20:59:45,577 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] ===
[2024-11-07 20:59:45,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 20:59:45,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1059093166, now seen corresponding path program 1 times
[2024-11-07 20:59:45,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 20:59:45,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314993667]
[2024-11-07 20:59:45,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 20:59:45,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 20:59:45,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:45,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3
[2024-11-07 20:59:45,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:45,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 20:59:45,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:45,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17
[2024-11-07 20:59:45,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:45,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 20:59:45,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:45,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42
[2024-11-07 20:59:45,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:45,725 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 20:59:45,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 20:59:45,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314993667]
[2024-11-07 20:59:45,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314993667] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 20:59:45,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 20:59:45,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-11-07 20:59:45,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117254587]
[2024-11-07 20:59:45,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 20:59:45,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-07 20:59:45,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 20:59:45,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-07 20:59:45,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2024-11-07 20:59:45,728 INFO L87 Difference]: Start difference. First operand 294 states and 412 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)
[2024-11-07 20:59:46,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 20:59:46,463 INFO L93 Difference]: Finished difference Result 906 states and 1274 transitions.
[2024-11-07 20:59:46,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2024-11-07 20:59:46,463 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55
[2024-11-07 20:59:46,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 20:59:46,468 INFO L225 Difference]: With dead ends: 906
[2024-11-07 20:59:46,468 INFO L226 Difference]: Without dead ends: 621
[2024-11-07 20:59:46,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272
[2024-11-07 20:59:46,470 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 348 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-11-07 20:59:46,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 688 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-11-07 20:59:46,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states.
[2024-11-07 20:59:46,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 467.
[2024-11-07 20:59:46,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 376 states have (on average 1.4202127659574468) internal successors, (534), 384 states have internal predecessors, (534), 53 states have call successors, (53), 30 states have call predecessors, (53), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66)
[2024-11-07 20:59:46,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 653 transitions.
[2024-11-07 20:59:46,532 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 653 transitions. Word has length 55
[2024-11-07 20:59:46,532 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 20:59:46,532 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 653 transitions.
[2024-11-07 20:59:46,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)
[2024-11-07 20:59:46,532 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 653 transitions.
[2024-11-07 20:59:46,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56
[2024-11-07 20:59:46,534 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 20:59:46,534 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]
[2024-11-07 20:59:46,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-07 20:59:46,535 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] ===
[2024-11-07 20:59:46,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 20:59:46,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1307239660, now seen corresponding path program 1 times
[2024-11-07 20:59:46,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 20:59:46,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547385786]
[2024-11-07 20:59:46,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 20:59:46,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 20:59:46,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:46,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3
[2024-11-07 20:59:46,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:46,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 20:59:46,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:46,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17
[2024-11-07 20:59:46,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:46,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 20:59:46,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:46,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42
[2024-11-07 20:59:46,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:46,642 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 20:59:46,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 20:59:46,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547385786]
[2024-11-07 20:59:46,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547385786] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 20:59:46,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 20:59:46,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-11-07 20:59:46,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695239206]
[2024-11-07 20:59:46,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 20:59:46,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-07 20:59:46,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 20:59:46,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-07 20:59:46,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2024-11-07 20:59:46,644 INFO L87 Difference]: Start difference. First operand 467 states and 653 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)
[2024-11-07 20:59:47,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 20:59:47,376 INFO L93 Difference]: Finished difference Result 1452 states and 2035 transitions.
[2024-11-07 20:59:47,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2024-11-07 20:59:47,377 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55
[2024-11-07 20:59:47,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 20:59:47,384 INFO L225 Difference]: With dead ends: 1452
[2024-11-07 20:59:47,384 INFO L226 Difference]: Without dead ends: 994
[2024-11-07 20:59:47,386 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272
[2024-11-07 20:59:47,387 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 288 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-11-07 20:59:47,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 658 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 717 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-11-07 20:59:47,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states.
[2024-11-07 20:59:47,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 776.
[2024-11-07 20:59:47,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 627 states have (on average 1.4098883572567784) internal successors, (884), 639 states have internal predecessors, (884), 85 states have call successors, (85), 52 states have call predecessors, (85), 60 states have return successors, (120), 92 states have call predecessors, (120), 85 states have call successors, (120)
[2024-11-07 20:59:47,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1089 transitions.
[2024-11-07 20:59:47,468 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1089 transitions. Word has length 55
[2024-11-07 20:59:47,469 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 20:59:47,469 INFO L471 AbstractCegarLoop]: Abstraction has 776 states and 1089 transitions.
[2024-11-07 20:59:47,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)
[2024-11-07 20:59:47,471 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1089 transitions.
[2024-11-07 20:59:47,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56
[2024-11-07 20:59:47,473 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 20:59:47,474 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]
[2024-11-07 20:59:47,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-07 20:59:47,474 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] ===
[2024-11-07 20:59:47,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 20:59:47,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1730886382, now seen corresponding path program 1 times
[2024-11-07 20:59:47,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 20:59:47,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472701676]
[2024-11-07 20:59:47,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 20:59:47,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 20:59:47,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:47,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3
[2024-11-07 20:59:47,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:47,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 20:59:47,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:47,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17
[2024-11-07 20:59:47,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:47,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 20:59:47,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:47,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42
[2024-11-07 20:59:47,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:47,590 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 20:59:47,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 20:59:47,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472701676]
[2024-11-07 20:59:47,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472701676] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 20:59:47,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 20:59:47,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-07 20:59:47,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650993698]
[2024-11-07 20:59:47,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 20:59:47,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-07 20:59:47,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 20:59:47,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-07 20:59:47,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-11-07 20:59:47,593 INFO L87 Difference]: Start difference. First operand 776 states and 1089 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)
[2024-11-07 20:59:48,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 20:59:48,229 INFO L93 Difference]: Finished difference Result 2163 states and 3049 transitions.
[2024-11-07 20:59:48,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-11-07 20:59:48,230 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55
[2024-11-07 20:59:48,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 20:59:48,237 INFO L225 Difference]: With dead ends: 2163
[2024-11-07 20:59:48,237 INFO L226 Difference]: Without dead ends: 1397
[2024-11-07 20:59:48,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132
[2024-11-07 20:59:48,240 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 411 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-11-07 20:59:48,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 502 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-11-07 20:59:48,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1397 states.
[2024-11-07 20:59:48,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1397 to 1190.
[2024-11-07 20:59:48,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1190 states, 958 states have (on average 1.3872651356993737) internal successors, (1329), 979 states have internal predecessors, (1329), 134 states have call successors, (134), 82 states have call predecessors, (134), 94 states have return successors, (179), 136 states have call predecessors, (179), 134 states have call successors, (179)
[2024-11-07 20:59:48,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1190 states to 1190 states and 1642 transitions.
[2024-11-07 20:59:48,350 INFO L78 Accepts]: Start accepts. Automaton has 1190 states and 1642 transitions. Word has length 55
[2024-11-07 20:59:48,350 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 20:59:48,350 INFO L471 AbstractCegarLoop]: Abstraction has 1190 states and 1642 transitions.
[2024-11-07 20:59:48,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)
[2024-11-07 20:59:48,350 INFO L276 IsEmpty]: Start isEmpty. Operand 1190 states and 1642 transitions.
[2024-11-07 20:59:48,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57
[2024-11-07 20:59:48,352 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 20:59:48,352 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]
[2024-11-07 20:59:48,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-07 20:59:48,352 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] ===
[2024-11-07 20:59:48,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 20:59:48,353 INFO L85 PathProgramCache]: Analyzing trace with hash 546564074, now seen corresponding path program 1 times
[2024-11-07 20:59:48,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 20:59:48,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381352696]
[2024-11-07 20:59:48,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 20:59:48,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 20:59:48,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:48,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3
[2024-11-07 20:59:48,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:48,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 20:59:48,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:48,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17
[2024-11-07 20:59:48,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:48,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 20:59:48,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:48,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42
[2024-11-07 20:59:48,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:48,441 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 20:59:48,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 20:59:48,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381352696]
[2024-11-07 20:59:48,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381352696] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 20:59:48,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 20:59:48,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-11-07 20:59:48,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625766579]
[2024-11-07 20:59:48,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 20:59:48,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-07 20:59:48,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 20:59:48,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-07 20:59:48,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2024-11-07 20:59:48,443 INFO L87 Difference]: Start difference. First operand 1190 states and 1642 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)
[2024-11-07 20:59:48,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 20:59:48,883 INFO L93 Difference]: Finished difference Result 2522 states and 3527 transitions.
[2024-11-07 20:59:48,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-11-07 20:59:48,883 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56
[2024-11-07 20:59:48,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 20:59:48,891 INFO L225 Difference]: With dead ends: 2522
[2024-11-07 20:59:48,891 INFO L226 Difference]: Without dead ends: 1342
[2024-11-07 20:59:48,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110
[2024-11-07 20:59:48,895 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 109 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-07 20:59:48,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 488 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-07 20:59:48,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states.
[2024-11-07 20:59:48,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 1205.
[2024-11-07 20:59:48,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1205 states, 973 states have (on average 1.3720452209660843) internal successors, (1335), 994 states have internal predecessors, (1335), 134 states have call successors, (134), 82 states have call predecessors, (134), 94 states have return successors, (179), 136 states have call predecessors, (179), 134 states have call successors, (179)
[2024-11-07 20:59:49,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1648 transitions.
[2024-11-07 20:59:49,006 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 1648 transitions. Word has length 56
[2024-11-07 20:59:49,006 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 20:59:49,007 INFO L471 AbstractCegarLoop]: Abstraction has 1205 states and 1648 transitions.
[2024-11-07 20:59:49,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)
[2024-11-07 20:59:49,007 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1648 transitions.
[2024-11-07 20:59:49,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57
[2024-11-07 20:59:49,008 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 20:59:49,008 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]
[2024-11-07 20:59:49,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-07 20:59:49,009 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] ===
[2024-11-07 20:59:49,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 20:59:49,009 INFO L85 PathProgramCache]: Analyzing trace with hash 474177516, now seen corresponding path program 1 times
[2024-11-07 20:59:49,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 20:59:49,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659247294]
[2024-11-07 20:59:49,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 20:59:49,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 20:59:49,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:49,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3
[2024-11-07 20:59:49,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:49,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 20:59:49,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:49,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17
[2024-11-07 20:59:49,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:49,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 20:59:49,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:49,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42
[2024-11-07 20:59:49,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:49,093 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 20:59:49,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 20:59:49,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659247294]
[2024-11-07 20:59:49,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659247294] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 20:59:49,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 20:59:49,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-11-07 20:59:49,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465937861]
[2024-11-07 20:59:49,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 20:59:49,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-07 20:59:49,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 20:59:49,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-07 20:59:49,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2024-11-07 20:59:49,098 INFO L87 Difference]: Start difference. First operand 1205 states and 1648 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)
[2024-11-07 20:59:49,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 20:59:49,538 INFO L93 Difference]: Finished difference Result 2594 states and 3595 transitions.
[2024-11-07 20:59:49,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2024-11-07 20:59:49,539 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56
[2024-11-07 20:59:49,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 20:59:49,548 INFO L225 Difference]: With dead ends: 2594
[2024-11-07 20:59:49,548 INFO L226 Difference]: Without dead ends: 1399
[2024-11-07 20:59:49,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182
[2024-11-07 20:59:49,553 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 114 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-07 20:59:49,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 483 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-07 20:59:49,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states.
[2024-11-07 20:59:49,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 1247.
[2024-11-07 20:59:49,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1247 states, 1015 states have (on average 1.3566502463054186) internal successors, (1377), 1036 states have internal predecessors, (1377), 134 states have call successors, (134), 82 states have call predecessors, (134), 94 states have return successors, (179), 136 states have call predecessors, (179), 134 states have call successors, (179)
[2024-11-07 20:59:49,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1247 states to 1247 states and 1690 transitions.
[2024-11-07 20:59:49,631 INFO L78 Accepts]: Start accepts. Automaton has 1247 states and 1690 transitions. Word has length 56
[2024-11-07 20:59:49,631 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 20:59:49,631 INFO L471 AbstractCegarLoop]: Abstraction has 1247 states and 1690 transitions.
[2024-11-07 20:59:49,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)
[2024-11-07 20:59:49,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1247 states and 1690 transitions.
[2024-11-07 20:59:49,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57
[2024-11-07 20:59:49,633 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 20:59:49,633 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]
[2024-11-07 20:59:49,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-11-07 20:59:49,633 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] ===
[2024-11-07 20:59:49,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 20:59:49,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1897561746, now seen corresponding path program 1 times
[2024-11-07 20:59:49,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 20:59:49,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941561823]
[2024-11-07 20:59:49,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 20:59:49,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 20:59:49,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:49,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3
[2024-11-07 20:59:49,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:49,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 20:59:49,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:49,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17
[2024-11-07 20:59:49,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:49,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 20:59:49,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:49,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42
[2024-11-07 20:59:49,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:49,772 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 20:59:49,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 20:59:49,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941561823]
[2024-11-07 20:59:49,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941561823] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 20:59:49,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 20:59:49,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-11-07 20:59:49,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203442710]
[2024-11-07 20:59:49,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 20:59:49,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-11-07 20:59:49,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 20:59:49,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-11-07 20:59:49,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2024-11-07 20:59:49,774 INFO L87 Difference]: Start difference. First operand 1247 states and 1690 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)
[2024-11-07 20:59:50,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 20:59:50,361 INFO L93 Difference]: Finished difference Result 1803 states and 2446 transitions.
[2024-11-07 20:59:50,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2024-11-07 20:59:50,361 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56
[2024-11-07 20:59:50,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 20:59:50,367 INFO L225 Difference]: With dead ends: 1803
[2024-11-07 20:59:50,367 INFO L226 Difference]: Without dead ends: 1068
[2024-11-07 20:59:50,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342
[2024-11-07 20:59:50,370 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 365 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-07 20:59:50,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 525 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-07 20:59:50,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states.
[2024-11-07 20:59:50,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 898.
[2024-11-07 20:59:50,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 898 states, 729 states have (on average 1.3443072702331962) internal successors, (980), 743 states have internal predecessors, (980), 100 states have call successors, (100), 59 states have call predecessors, (100), 65 states have return successors, (115), 99 states have call predecessors, (115), 100 states have call successors, (115)
[2024-11-07 20:59:50,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 898 states and 1195 transitions.
[2024-11-07 20:59:50,447 INFO L78 Accepts]: Start accepts. Automaton has 898 states and 1195 transitions. Word has length 56
[2024-11-07 20:59:50,448 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 20:59:50,448 INFO L471 AbstractCegarLoop]: Abstraction has 898 states and 1195 transitions.
[2024-11-07 20:59:50,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)
[2024-11-07 20:59:50,448 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 1195 transitions.
[2024-11-07 20:59:50,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57
[2024-11-07 20:59:50,449 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 20:59:50,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]
[2024-11-07 20:59:50,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-11-07 20:59:50,449 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] ===
[2024-11-07 20:59:50,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 20:59:50,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1678707028, now seen corresponding path program 1 times
[2024-11-07 20:59:50,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 20:59:50,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883796513]
[2024-11-07 20:59:50,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 20:59:50,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 20:59:50,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:50,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3
[2024-11-07 20:59:50,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:50,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 20:59:50,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:50,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17
[2024-11-07 20:59:50,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:50,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 20:59:50,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:50,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42
[2024-11-07 20:59:50,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:50,564 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 20:59:50,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 20:59:50,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883796513]
[2024-11-07 20:59:50,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883796513] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 20:59:50,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 20:59:50,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-11-07 20:59:50,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996115729]
[2024-11-07 20:59:50,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 20:59:50,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-11-07 20:59:50,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 20:59:50,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-11-07 20:59:50,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2024-11-07 20:59:50,566 INFO L87 Difference]: Start difference. First operand 898 states and 1195 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)
[2024-11-07 20:59:51,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 20:59:51,198 INFO L93 Difference]: Finished difference Result 1744 states and 2330 transitions.
[2024-11-07 20:59:51,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2024-11-07 20:59:51,198 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56
[2024-11-07 20:59:51,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 20:59:51,204 INFO L225 Difference]: With dead ends: 1744
[2024-11-07 20:59:51,204 INFO L226 Difference]: Without dead ends: 1096
[2024-11-07 20:59:51,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380
[2024-11-07 20:59:51,206 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 362 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-07 20:59:51,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 520 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-07 20:59:51,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1096 states.
[2024-11-07 20:59:51,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1096 to 892.
[2024-11-07 20:59:51,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 892 states, 725 states have (on average 1.3393103448275863) internal successors, (971), 737 states have internal predecessors, (971), 100 states have call successors, (100), 59 states have call predecessors, (100), 63 states have return successors, (107), 97 states have call predecessors, (107), 100 states have call successors, (107)
[2024-11-07 20:59:51,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1178 transitions.
[2024-11-07 20:59:51,270 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1178 transitions. Word has length 56
[2024-11-07 20:59:51,270 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 20:59:51,270 INFO L471 AbstractCegarLoop]: Abstraction has 892 states and 1178 transitions.
[2024-11-07 20:59:51,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)
[2024-11-07 20:59:51,271 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1178 transitions.
[2024-11-07 20:59:51,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57
[2024-11-07 20:59:51,271 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 20:59:51,271 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]
[2024-11-07 20:59:51,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-11-07 20:59:51,272 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] ===
[2024-11-07 20:59:51,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 20:59:51,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1256005202, now seen corresponding path program 1 times
[2024-11-07 20:59:51,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 20:59:51,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681632958]
[2024-11-07 20:59:51,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 20:59:51,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 20:59:51,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:51,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3
[2024-11-07 20:59:51,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:51,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 20:59:51,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:51,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17
[2024-11-07 20:59:51,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:51,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 20:59:51,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:51,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42
[2024-11-07 20:59:51,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:51,418 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 20:59:51,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 20:59:51,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681632958]
[2024-11-07 20:59:51,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681632958] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 20:59:51,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 20:59:51,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-11-07 20:59:51,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171121108]
[2024-11-07 20:59:51,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 20:59:51,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-11-07 20:59:51,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 20:59:51,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-11-07 20:59:51,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2024-11-07 20:59:51,421 INFO L87 Difference]: Start difference. First operand 892 states and 1178 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)
[2024-11-07 20:59:51,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 20:59:51,959 INFO L93 Difference]: Finished difference Result 1681 states and 2217 transitions.
[2024-11-07 20:59:51,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2024-11-07 20:59:51,959 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56
[2024-11-07 20:59:51,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 20:59:51,964 INFO L225 Difference]: With dead ends: 1681
[2024-11-07 20:59:51,964 INFO L226 Difference]: Without dead ends: 948
[2024-11-07 20:59:51,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342
[2024-11-07 20:59:51,967 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 411 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-07 20:59:51,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 492 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-07 20:59:51,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states.
[2024-11-07 20:59:52,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 776.
[2024-11-07 20:59:52,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 634 states have (on average 1.334384858044164) internal successors, (846), 644 states have internal predecessors, (846), 85 states have call successors, (85), 51 states have call predecessors, (85), 53 states have return successors, (87), 81 states have call predecessors, (87), 85 states have call successors, (87)
[2024-11-07 20:59:52,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1018 transitions.
[2024-11-07 20:59:52,014 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1018 transitions. Word has length 56
[2024-11-07 20:59:52,015 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 20:59:52,015 INFO L471 AbstractCegarLoop]: Abstraction has 776 states and 1018 transitions.
[2024-11-07 20:59:52,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)
[2024-11-07 20:59:52,015 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1018 transitions.
[2024-11-07 20:59:52,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57
[2024-11-07 20:59:52,017 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 20:59:52,017 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]
[2024-11-07 20:59:52,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-11-07 20:59:52,017 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] ===
[2024-11-07 20:59:52,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 20:59:52,018 INFO L85 PathProgramCache]: Analyzing trace with hash -2073653652, now seen corresponding path program 1 times
[2024-11-07 20:59:52,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 20:59:52,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079299104]
[2024-11-07 20:59:52,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 20:59:52,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 20:59:52,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:52,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3
[2024-11-07 20:59:52,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:52,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 20:59:52,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:52,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17
[2024-11-07 20:59:52,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:52,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 20:59:52,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:52,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42
[2024-11-07 20:59:52,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:52,108 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 20:59:52,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 20:59:52,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079299104]
[2024-11-07 20:59:52,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079299104] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 20:59:52,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 20:59:52,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-07 20:59:52,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207111589]
[2024-11-07 20:59:52,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 20:59:52,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-07 20:59:52,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 20:59:52,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-07 20:59:52,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-11-07 20:59:52,110 INFO L87 Difference]: Start difference. First operand 776 states and 1018 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)
[2024-11-07 20:59:52,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 20:59:52,556 INFO L93 Difference]: Finished difference Result 2414 states and 3226 transitions.
[2024-11-07 20:59:52,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-11-07 20:59:52,557 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56
[2024-11-07 20:59:52,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 20:59:52,565 INFO L225 Difference]: With dead ends: 2414
[2024-11-07 20:59:52,565 INFO L226 Difference]: Without dead ends: 1649
[2024-11-07 20:59:52,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132
[2024-11-07 20:59:52,568 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 333 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-07 20:59:52,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 418 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-07 20:59:52,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1649 states.
[2024-11-07 20:59:52,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1649 to 1475.
[2024-11-07 20:59:52,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1475 states, 1205 states have (on average 1.3195020746887967) internal successors, (1590), 1222 states have internal predecessors, (1590), 158 states have call successors, (158), 97 states have call predecessors, (158), 108 states have return successors, (201), 157 states have call predecessors, (201), 158 states have call successors, (201)
[2024-11-07 20:59:52,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1475 states to 1475 states and 1949 transitions.
[2024-11-07 20:59:52,680 INFO L78 Accepts]: Start accepts. Automaton has 1475 states and 1949 transitions. Word has length 56
[2024-11-07 20:59:52,681 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 20:59:52,681 INFO L471 AbstractCegarLoop]: Abstraction has 1475 states and 1949 transitions.
[2024-11-07 20:59:52,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)
[2024-11-07 20:59:52,681 INFO L276 IsEmpty]: Start isEmpty. Operand 1475 states and 1949 transitions.
[2024-11-07 20:59:52,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58
[2024-11-07 20:59:52,685 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 20:59:52,685 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]
[2024-11-07 20:59:52,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-11-07 20:59:52,685 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] ===
[2024-11-07 20:59:52,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 20:59:52,686 INFO L85 PathProgramCache]: Analyzing trace with hash -929955691, now seen corresponding path program 1 times
[2024-11-07 20:59:52,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 20:59:52,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603687208]
[2024-11-07 20:59:52,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 20:59:52,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 20:59:52,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:52,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3
[2024-11-07 20:59:52,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:52,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 20:59:52,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:52,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17
[2024-11-07 20:59:52,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:52,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 20:59:52,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:52,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42
[2024-11-07 20:59:52,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:52,740 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 20:59:52,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 20:59:52,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603687208]
[2024-11-07 20:59:52,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603687208] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 20:59:52,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 20:59:52,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-07 20:59:52,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255272645]
[2024-11-07 20:59:52,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 20:59:52,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-07 20:59:52,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 20:59:52,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-07 20:59:52,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-07 20:59:52,744 INFO L87 Difference]: Start difference. First operand 1475 states and 1949 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)
[2024-11-07 20:59:53,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 20:59:53,035 INFO L93 Difference]: Finished difference Result 2839 states and 3733 transitions.
[2024-11-07 20:59:53,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-07 20:59:53,036 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57
[2024-11-07 20:59:53,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 20:59:53,042 INFO L225 Difference]: With dead ends: 2839
[2024-11-07 20:59:53,042 INFO L226 Difference]: Without dead ends: 1375
[2024-11-07 20:59:53,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2024-11-07 20:59:53,045 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 268 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-07 20:59:53,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 220 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-07 20:59:53,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1375 states.
[2024-11-07 20:59:53,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1375 to 1198.
[2024-11-07 20:59:53,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1198 states, 984 states have (on average 1.309959349593496) internal successors, (1289), 999 states have internal predecessors, (1289), 122 states have call successors, (122), 78 states have call predecessors, (122), 88 states have return successors, (152), 121 states have call predecessors, (152), 122 states have call successors, (152)
[2024-11-07 20:59:53,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 1563 transitions.
[2024-11-07 20:59:53,118 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 1563 transitions. Word has length 57
[2024-11-07 20:59:53,118 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 20:59:53,118 INFO L471 AbstractCegarLoop]: Abstraction has 1198 states and 1563 transitions.
[2024-11-07 20:59:53,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)
[2024-11-07 20:59:53,119 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1563 transitions.
[2024-11-07 20:59:53,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59
[2024-11-07 20:59:53,119 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 20:59:53,119 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]
[2024-11-07 20:59:53,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-11-07 20:59:53,119 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] ===
[2024-11-07 20:59:53,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 20:59:53,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1685794816, now seen corresponding path program 1 times
[2024-11-07 20:59:53,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 20:59:53,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210301951]
[2024-11-07 20:59:53,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 20:59:53,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 20:59:53,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:53,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3
[2024-11-07 20:59:53,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:53,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 20:59:53,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:53,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17
[2024-11-07 20:59:53,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:53,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 20:59:53,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:53,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42
[2024-11-07 20:59:53,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:53,174 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 20:59:53,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 20:59:53,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210301951]
[2024-11-07 20:59:53,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210301951] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 20:59:53,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 20:59:53,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-07 20:59:53,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724123147]
[2024-11-07 20:59:53,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 20:59:53,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-07 20:59:53,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 20:59:53,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-07 20:59:53,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-07 20:59:53,176 INFO L87 Difference]: Start difference. First operand 1198 states and 1563 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5)
[2024-11-07 20:59:53,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 20:59:53,590 INFO L93 Difference]: Finished difference Result 3437 states and 4509 transitions.
[2024-11-07 20:59:53,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-11-07 20:59:53,590 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 58
[2024-11-07 20:59:53,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 20:59:53,600 INFO L225 Difference]: With dead ends: 3437
[2024-11-07 20:59:53,601 INFO L226 Difference]: Without dead ends: 2249
[2024-11-07 20:59:53,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72
[2024-11-07 20:59:53,605 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 320 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-07 20:59:53,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 358 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-07 20:59:53,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2249 states.
[2024-11-07 20:59:53,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2249 to 1957.
[2024-11-07 20:59:53,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1957 states, 1605 states have (on average 1.291588785046729) internal successors, (2073), 1629 states have internal predecessors, (2073), 200 states have call successors, (200), 132 states have call predecessors, (200), 148 states have return successors, (249), 196 states have call predecessors, (249), 200 states have call successors, (249)
[2024-11-07 20:59:53,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1957 states to 1957 states and 2522 transitions.
[2024-11-07 20:59:53,736 INFO L78 Accepts]: Start accepts. Automaton has 1957 states and 2522 transitions. Word has length 58
[2024-11-07 20:59:53,737 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 20:59:53,738 INFO L471 AbstractCegarLoop]: Abstraction has 1957 states and 2522 transitions.
[2024-11-07 20:59:53,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5)
[2024-11-07 20:59:53,738 INFO L276 IsEmpty]: Start isEmpty. Operand 1957 states and 2522 transitions.
[2024-11-07 20:59:53,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78
[2024-11-07 20:59:53,739 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 20:59:53,739 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 20:59:53,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-11-07 20:59:53,739 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] ===
[2024-11-07 20:59:53,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 20:59:53,740 INFO L85 PathProgramCache]: Analyzing trace with hash -2084904940, now seen corresponding path program 1 times
[2024-11-07 20:59:53,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 20:59:53,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783981098]
[2024-11-07 20:59:53,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 20:59:53,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 20:59:53,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:53,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3
[2024-11-07 20:59:53,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:53,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 20:59:53,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:53,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17
[2024-11-07 20:59:53,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:53,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 20:59:53,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:53,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42
[2024-11-07 20:59:53,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:53,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61
[2024-11-07 20:59:53,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:53,824 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2024-11-07 20:59:53,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 20:59:53,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783981098]
[2024-11-07 20:59:53,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783981098] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 20:59:53,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 20:59:53,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-07 20:59:53,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328422577]
[2024-11-07 20:59:53,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 20:59:53,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-07 20:59:53,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 20:59:53,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-07 20:59:53,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-11-07 20:59:53,825 INFO L87 Difference]: Start difference. First operand 1957 states and 2522 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6)
[2024-11-07 20:59:54,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 20:59:54,685 INFO L93 Difference]: Finished difference Result 6219 states and 8078 transitions.
[2024-11-07 20:59:54,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2024-11-07 20:59:54,686 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 77
[2024-11-07 20:59:54,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 20:59:54,703 INFO L225 Difference]: With dead ends: 6219
[2024-11-07 20:59:54,703 INFO L226 Difference]: Without dead ends: 4273
[2024-11-07 20:59:54,708 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272
[2024-11-07 20:59:54,709 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 664 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-11-07 20:59:54,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 501 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-11-07 20:59:54,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4273 states.
[2024-11-07 20:59:54,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4273 to 3838.
[2024-11-07 20:59:54,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3838 states, 3136 states have (on average 1.2729591836734695) internal successors, (3992), 3197 states have internal predecessors, (3992), 384 states have call successors, (384), 258 states have call predecessors, (384), 314 states have return successors, (586), 384 states have call predecessors, (586), 384 states have call successors, (586)
[2024-11-07 20:59:54,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3838 states to 3838 states and 4962 transitions.
[2024-11-07 20:59:54,970 INFO L78 Accepts]: Start accepts. Automaton has 3838 states and 4962 transitions. Word has length 77
[2024-11-07 20:59:54,973 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 20:59:54,973 INFO L471 AbstractCegarLoop]: Abstraction has 3838 states and 4962 transitions.
[2024-11-07 20:59:54,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6)
[2024-11-07 20:59:54,973 INFO L276 IsEmpty]: Start isEmpty. Operand 3838 states and 4962 transitions.
[2024-11-07 20:59:54,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92
[2024-11-07 20:59:54,974 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 20:59:54,975 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:59:54,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-11-07 20:59:54,975 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] ===
[2024-11-07 20:59:54,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 20:59:54,975 INFO L85 PathProgramCache]: Analyzing trace with hash 992575416, now seen corresponding path program 1 times
[2024-11-07 20:59:54,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 20:59:54,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587922436]
[2024-11-07 20:59:54,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 20:59:54,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 20:59:54,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:55,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3
[2024-11-07 20:59:55,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:55,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 20:59:55,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:55,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17
[2024-11-07 20:59:55,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:55,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 20:59:55,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:55,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42
[2024-11-07 20:59:55,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:55,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55
[2024-11-07 20:59:55,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:55,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2024-11-07 20:59:55,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:55,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78
[2024-11-07 20:59:55,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:55,195 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked.
[2024-11-07 20:59:55,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 20:59:55,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587922436]
[2024-11-07 20:59:55,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587922436] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 20:59:55,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 20:59:55,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-11-07 20:59:55,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687253532]
[2024-11-07 20:59:55,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 20:59:55,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-07 20:59:55,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 20:59:55,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-07 20:59:55,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-11-07 20:59:55,197 INFO L87 Difference]: Start difference. First operand 3838 states and 4962 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8)
[2024-11-07 20:59:55,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 20:59:55,860 INFO L93 Difference]: Finished difference Result 7403 states and 9536 transitions.
[2024-11-07 20:59:55,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-11-07 20:59:55,861 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 91
[2024-11-07 20:59:55,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 20:59:55,880 INFO L225 Difference]: With dead ends: 7403
[2024-11-07 20:59:55,880 INFO L226 Difference]: Without dead ends: 4339
[2024-11-07 20:59:55,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156
[2024-11-07 20:59:55,889 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 443 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-07 20:59:55,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 368 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-07 20:59:55,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4339 states.
[2024-11-07 20:59:56,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4339 to 3806.
[2024-11-07 20:59:56,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3806 states, 3100 states have (on average 1.2632258064516129) internal successors, (3916), 3165 states have internal predecessors, (3916), 384 states have call successors, (384), 258 states have call predecessors, (384), 318 states have return successors, (531), 384 states have call predecessors, (531), 384 states have call successors, (531)
[2024-11-07 20:59:56,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3806 states to 3806 states and 4831 transitions.
[2024-11-07 20:59:56,193 INFO L78 Accepts]: Start accepts. Automaton has 3806 states and 4831 transitions. Word has length 91
[2024-11-07 20:59:56,195 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 20:59:56,196 INFO L471 AbstractCegarLoop]: Abstraction has 3806 states and 4831 transitions.
[2024-11-07 20:59:56,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8)
[2024-11-07 20:59:56,196 INFO L276 IsEmpty]: Start isEmpty. Operand 3806 states and 4831 transitions.
[2024-11-07 20:59:56,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92
[2024-11-07 20:59:56,198 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 20:59:56,198 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:59:56,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-11-07 20:59:56,199 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] ===
[2024-11-07 20:59:56,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 20:59:56,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1977535686, now seen corresponding path program 1 times
[2024-11-07 20:59:56,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 20:59:56,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456296736]
[2024-11-07 20:59:56,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 20:59:56,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 20:59:56,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:56,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3
[2024-11-07 20:59:56,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:56,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 20:59:56,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:56,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17
[2024-11-07 20:59:56,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:56,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 20:59:56,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:56,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42
[2024-11-07 20:59:56,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:56,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55
[2024-11-07 20:59:56,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:56,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2024-11-07 20:59:56,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:56,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78
[2024-11-07 20:59:56,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:56,258 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked.
[2024-11-07 20:59:56,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 20:59:56,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456296736]
[2024-11-07 20:59:56,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456296736] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 20:59:56,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 20:59:56,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-07 20:59:56,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346425324]
[2024-11-07 20:59:56,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 20:59:56,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-07 20:59:56,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 20:59:56,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-07 20:59:56,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-07 20:59:56,261 INFO L87 Difference]: Start difference. First operand 3806 states and 4831 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 3 states have internal predecessors, (53), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7)
[2024-11-07 20:59:56,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 20:59:56,670 INFO L93 Difference]: Finished difference Result 4201 states and 5349 transitions.
[2024-11-07 20:59:56,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-07 20:59:56,670 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 3 states have internal predecessors, (53), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 91
[2024-11-07 20:59:56,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 20:59:56,687 INFO L225 Difference]: With dead ends: 4201
[2024-11-07 20:59:56,687 INFO L226 Difference]: Without dead ends: 3463
[2024-11-07 20:59:56,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2024-11-07 20:59:56,691 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 266 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-07 20:59:56,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 215 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-07 20:59:56,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3463 states.
[2024-11-07 20:59:56,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3463 to 3070.
[2024-11-07 20:59:56,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3070 states, 2505 states have (on average 1.2686626746506986) internal successors, (3178), 2560 states have internal predecessors, (3178), 303 states have call successors, (303), 204 states have call predecessors, (303), 258 states have return successors, (431), 306 states have call predecessors, (431), 303 states have call successors, (431)
[2024-11-07 20:59:56,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3070 states to 3070 states and 3912 transitions.
[2024-11-07 20:59:56,933 INFO L78 Accepts]: Start accepts. Automaton has 3070 states and 3912 transitions. Word has length 91
[2024-11-07 20:59:56,933 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 20:59:56,933 INFO L471 AbstractCegarLoop]: Abstraction has 3070 states and 3912 transitions.
[2024-11-07 20:59:56,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 3 states have internal predecessors, (53), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7)
[2024-11-07 20:59:56,934 INFO L276 IsEmpty]: Start isEmpty. Operand 3070 states and 3912 transitions.
[2024-11-07 20:59:56,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94
[2024-11-07 20:59:56,935 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 20:59:56,935 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:59:56,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-11-07 20:59:56,936 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] ===
[2024-11-07 20:59:56,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 20:59:56,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1540260944, now seen corresponding path program 1 times
[2024-11-07 20:59:56,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 20:59:56,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254724531]
[2024-11-07 20:59:56,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 20:59:56,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 20:59:56,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:56,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3
[2024-11-07 20:59:56,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:57,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 20:59:57,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:57,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17
[2024-11-07 20:59:57,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:57,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 20:59:57,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:57,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42
[2024-11-07 20:59:57,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:57,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55
[2024-11-07 20:59:57,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:57,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2024-11-07 20:59:57,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:57,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80
[2024-11-07 20:59:57,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:57,038 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked.
[2024-11-07 20:59:57,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 20:59:57,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254724531]
[2024-11-07 20:59:57,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254724531] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 20:59:57,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 20:59:57,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-11-07 20:59:57,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649312400]
[2024-11-07 20:59:57,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 20:59:57,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-07 20:59:57,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 20:59:57,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-07 20:59:57,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2024-11-07 20:59:57,041 INFO L87 Difference]: Start difference. First operand 3070 states and 3912 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8)
[2024-11-07 20:59:58,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 20:59:58,056 INFO L93 Difference]: Finished difference Result 5358 states and 6905 transitions.
[2024-11-07 20:59:58,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states.
[2024-11-07 20:59:58,057 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 93
[2024-11-07 20:59:58,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 20:59:58,071 INFO L225 Difference]: With dead ends: 5358
[2024-11-07 20:59:58,072 INFO L226 Difference]: Without dead ends: 3380
[2024-11-07 20:59:58,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420
[2024-11-07 20:59:58,077 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 1024 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1038 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2024-11-07 20:59:58,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1038 Valid, 570 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2024-11-07 20:59:58,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3380 states.
[2024-11-07 20:59:58,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3380 to 3070.
[2024-11-07 20:59:58,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3070 states, 2505 states have (on average 1.259880239520958) internal successors, (3156), 2560 states have internal predecessors, (3156), 303 states have call successors, (303), 204 states have call predecessors, (303), 258 states have return successors, (398), 306 states have call predecessors, (398), 303 states have call successors, (398)
[2024-11-07 20:59:58,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3070 states to 3070 states and 3857 transitions.
[2024-11-07 20:59:58,409 INFO L78 Accepts]: Start accepts. Automaton has 3070 states and 3857 transitions. Word has length 93
[2024-11-07 20:59:58,410 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 20:59:58,410 INFO L471 AbstractCegarLoop]: Abstraction has 3070 states and 3857 transitions.
[2024-11-07 20:59:58,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8)
[2024-11-07 20:59:58,411 INFO L276 IsEmpty]: Start isEmpty. Operand 3070 states and 3857 transitions.
[2024-11-07 20:59:58,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101
[2024-11-07 20:59:58,412 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 20:59:58,412 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:59:58,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-11-07 20:59:58,412 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] ===
[2024-11-07 20:59:58,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 20:59:58,413 INFO L85 PathProgramCache]: Analyzing trace with hash 432140425, now seen corresponding path program 1 times
[2024-11-07 20:59:58,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 20:59:58,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202661017]
[2024-11-07 20:59:58,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 20:59:58,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 20:59:58,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:58,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3
[2024-11-07 20:59:58,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:58,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 20:59:58,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:58,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17
[2024-11-07 20:59:58,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:58,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 20:59:58,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:58,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42
[2024-11-07 20:59:58,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:58,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61
[2024-11-07 20:59:58,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:58,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74
[2024-11-07 20:59:58,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:58,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2024-11-07 20:59:58,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 20:59:58,485 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked.
[2024-11-07 20:59:58,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 20:59:58,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202661017]
[2024-11-07 20:59:58,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202661017] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 20:59:58,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 20:59:58,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-07 20:59:58,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084714550]
[2024-11-07 20:59:58,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 20:59:58,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-07 20:59:58,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 20:59:58,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-07 20:59:58,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-07 20:59:58,488 INFO L87 Difference]: Start difference. First operand 3070 states and 3857 transitions. Second operand has 5 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7)
[2024-11-07 20:59:58,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 20:59:58,942 INFO L93 Difference]: Finished difference Result 3463 states and 4375 transitions.
[2024-11-07 20:59:58,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-07 20:59:58,943 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 100
[2024-11-07 20:59:58,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 20:59:58,959 INFO L225 Difference]: With dead ends: 3463
[2024-11-07 20:59:58,959 INFO L226 Difference]: Without dead ends: 3462
[2024-11-07 20:59:58,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2024-11-07 20:59:58,961 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 260 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-07 20:59:58,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 203 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-07 20:59:58,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3462 states.
[2024-11-07 20:59:59,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3462 to 3069.
[2024-11-07 20:59:59,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3069 states, 2505 states have (on average 1.2562874251497007) internal successors, (3147), 2559 states have internal predecessors, (3147), 303 states have call successors, (303), 204 states have call predecessors, (303), 258 states have return successors, (398), 306 states have call predecessors, (398), 303 states have call successors, (398)
[2024-11-07 20:59:59,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3069 states to 3069 states and 3848 transitions.
[2024-11-07 20:59:59,186 INFO L78 Accepts]: Start accepts. Automaton has 3069 states and 3848 transitions. Word has length 100
[2024-11-07 20:59:59,187 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 20:59:59,187 INFO L471 AbstractCegarLoop]: Abstraction has 3069 states and 3848 transitions.
[2024-11-07 20:59:59,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7)
[2024-11-07 20:59:59,187 INFO L276 IsEmpty]: Start isEmpty. Operand 3069 states and 3848 transitions.
[2024-11-07 20:59:59,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102
[2024-11-07 20:59:59,189 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 20:59:59,189 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:59:59,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-11-07 20:59:59,189 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] ===
[2024-11-07 20:59:59,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 20:59:59,190 INFO L85 PathProgramCache]: Analyzing trace with hash 511451573, now seen corresponding path program 1 times
[2024-11-07 20:59:59,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 20:59:59,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800741453]
[2024-11-07 20:59:59,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 20:59:59,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 20:59:59,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 20:59:59,205 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 20:59:59,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 20:59:59,250 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 20:59:59,250 INFO L325 BasicCegarLoop]: Counterexample is feasible
[2024-11-07 20:59:59,251 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining)
[2024-11-07 20:59:59,253 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining)
[2024-11-07 20:59:59,253 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining)
[2024-11-07 20:59:59,253 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining)
[2024-11-07 20:59:59,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-11-07 20:59:59,257 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 20:59:59,335 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-07 20:59:59,338 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:59:59 BoogieIcfgContainer
[2024-11-07 20:59:59,339 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-07 20:59:59,340 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-07 20:59:59,340 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-07 20:59:59,340 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-07 20:59:59,341 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:59:43" (3/4) ...
[2024-11-07 20:59:59,341 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample
[2024-11-07 20:59:59,425 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml
[2024-11-07 20:59:59,426 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-07 20:59:59,426 INFO L158 Benchmark]: Toolchain (without parser) took 16994.74ms. Allocated memory was 100.7MB in the beginning and 721.4MB in the end (delta: 620.8MB). Free memory was 77.2MB in the beginning and 289.5MB in the end (delta: -212.2MB). Peak memory consumption was 403.6MB. Max. memory is 16.1GB.
[2024-11-07 20:59:59,427 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 83.9MB. Free memory is still 47.6MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 20:59:59,427 INFO L158 Benchmark]: CACSL2BoogieTranslator took 226.90ms. Allocated memory is still 100.7MB. Free memory was 77.1MB in the beginning and 64.3MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-07 20:59:59,427 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.24ms. Allocated memory is still 100.7MB. Free memory was 64.3MB in the beginning and 62.7MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-07 20:59:59,427 INFO L158 Benchmark]: Boogie Preprocessor took 56.52ms. Allocated memory is still 100.7MB. Free memory was 62.7MB in the beginning and 60.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 20:59:59,427 INFO L158 Benchmark]: RCFGBuilder took 390.15ms. Allocated memory is still 100.7MB. Free memory was 60.8MB in the beginning and 42.9MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2024-11-07 20:59:59,428 INFO L158 Benchmark]: TraceAbstraction took 16200.84ms. Allocated memory was 100.7MB in the beginning and 721.4MB in the end (delta: 620.8MB). Free memory was 42.4MB in the beginning and 297.9MB in the end (delta: -255.4MB). Peak memory consumption was 361.7MB. Max. memory is 16.1GB.
[2024-11-07 20:59:59,428 INFO L158 Benchmark]: Witness Printer took 86.04ms. Allocated memory is still 721.4MB. Free memory was 297.9MB in the beginning and 289.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-07 20:59:59,429 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.28ms. Allocated memory is still 83.9MB. Free memory is still 47.6MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 226.90ms. Allocated memory is still 100.7MB. Free memory was 77.1MB in the beginning and 64.3MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 28.24ms. Allocated memory is still 100.7MB. Free memory was 64.3MB in the beginning and 62.7MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 56.52ms. Allocated memory is still 100.7MB. Free memory was 62.7MB in the beginning and 60.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB.
* RCFGBuilder took 390.15ms. Allocated memory is still 100.7MB. Free memory was 60.8MB in the beginning and 42.9MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
* TraceAbstraction took 16200.84ms. Allocated memory was 100.7MB in the beginning and 721.4MB in the end (delta: 620.8MB). Free memory was 42.4MB in the beginning and 297.9MB in the end (delta: -255.4MB). Peak memory consumption was 361.7MB. Max. memory is 16.1GB.
* Witness Printer took 86.04ms. Allocated memory is still 721.4MB. Free memory was 297.9MB in the beginning and 289.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: ErrorAutomatonStatistics
NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
- CounterExampleResult [Line: 107]: integer overflow possible
integer overflow possible
We found a FailurePath:
[L24] int m_pc = 0;
[L25] int t1_pc = 0;
[L26] int m_st ;
[L27] int t1_st ;
[L28] int m_i ;
[L29] int t1_i ;
[L30] int M_E = 2;
[L31] int T1_E = 2;
[L32] int E_M = 2;
[L33] int E_1 = 2;
[L37] int token ;
[L39] int local ;
VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=0, m_pc=0, m_st=0, t1_i=0, t1_pc=0, t1_st=0, token=0]
[L473] int __retres1 ;
[L477] CALL init_model()
[L388] m_i = 1
[L389] t1_i = 1
VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0]
[L477] RET init_model()
[L478] CALL start_simulation()
[L414] int kernel_st ;
[L415] int tmp ;
[L416] int tmp___0 ;
[L420] kernel_st = 0
VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0]
[L421] FCALL update_channels()
VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0]
[L422] CALL init_threads()
[L170] COND TRUE m_i == 1
[L171] m_st = 0
VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0]
[L175] COND TRUE t1_i == 1
[L176] t1_st = 0
VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0]
[L422] RET init_threads()
[L423] CALL fire_delta_events()
VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0]
[L259] COND FALSE !(M_E == 0)
VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0]
[L264] COND FALSE !(T1_E == 0)
VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0]
[L269] COND FALSE !(E_M == 0)
VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0]
[L274] COND FALSE !(E_1 == 0)
VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0]
[L423] RET fire_delta_events()
VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0]
[L424] CALL activate_threads()
VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0]
[L312] int tmp ;
[L313] int tmp___0 ;
[L317] CALL, EXPR is_master_triggered()
[L121] int __retres1 ;
VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0]
[L124] COND FALSE !(m_pc == 1)
VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0]
[L134] __retres1 = 0
VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0]
[L136] return (__retres1);
VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, \result=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0]
[L317] RET, EXPR is_master_triggered()
[L317] tmp = is_master_triggered()
[L319] COND FALSE !(\read(tmp))
VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0]
[L325] CALL, EXPR is_transmit1_triggered()
[L140] int __retres1 ;
VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0]
[L143] COND FALSE !(t1_pc == 1)
VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0]
[L153] __retres1 = 0
VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0]
[L155] return (__retres1);
VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, \result=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0]
[L325] RET, EXPR is_transmit1_triggered()
[L325] tmp___0 = is_transmit1_triggered()
[L327] COND FALSE !(\read(tmp___0))
VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0]
[L424] RET activate_threads()
VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0]
[L425] CALL reset_delta_events()
VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0]
[L287] COND FALSE !(M_E == 1)
VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0]
[L292] COND FALSE !(T1_E == 1)
VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0]
[L297] COND FALSE !(E_M == 1)
VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0]
[L302] COND FALSE !(E_1 == 1)
VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0]
[L425] RET reset_delta_events()
VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0]
[L428] COND TRUE 1
VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0]
[L431] kernel_st = 1
[L432] CALL eval()
[L206] int tmp ;
VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0]
[L210] COND TRUE 1
VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0]
[L213] CALL, EXPR exists_runnable_thread()
VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0]
[L185] int __retres1 ;
VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0]
[L188] COND TRUE m_st == 0
[L189] __retres1 = 1
VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0]
[L201] return (__retres1);
VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \result=1, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0]
[L213] RET, EXPR exists_runnable_thread()
VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0]
[L213] tmp = exists_runnable_thread()
[L215] COND TRUE \read(tmp)
VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0]
[L220] COND TRUE m_st == 0
[L221] int tmp_ndt_1;
[L222] tmp_ndt_1 = __VERIFIER_nondet_int()
[L223] COND FALSE !(\read(tmp_ndt_1))
VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0]
[L234] COND TRUE t1_st == 0
[L235] int tmp_ndt_2;
[L236] tmp_ndt_2 = __VERIFIER_nondet_int()
[L237] COND TRUE \read(tmp_ndt_2)
[L239] t1_st = 1
[L240] CALL transmit1()
[L88] COND TRUE t1_pc == 0
VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1, token=0]
[L99] COND TRUE 1
VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1, token=0]
[L101] t1_pc = 1
[L102] t1_st = 2
VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0]
[L240] RET transmit1()
[L210] COND TRUE 1
VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0]
[L213] CALL, EXPR exists_runnable_thread()
VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0]
[L185] int __retres1 ;
VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0]
[L188] COND TRUE m_st == 0
[L189] __retres1 = 1
VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0]
[L201] return (__retres1);
VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \result=1, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0]
[L213] RET, EXPR exists_runnable_thread()
VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0]
[L213] tmp = exists_runnable_thread()
[L215] COND TRUE \read(tmp)
VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0]
[L220] COND TRUE m_st == 0
[L221] int tmp_ndt_1;
[L222] tmp_ndt_1 = __VERIFIER_nondet_int()
[L223] COND TRUE \read(tmp_ndt_1)
[L225] m_st = 1
[L226] CALL master()
[L44] COND TRUE m_pc == 0
VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0]
[L55] COND TRUE 1
VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0]
[L58] token = __VERIFIER_nondet_int()
[L59] local = token
[L60] E_1 = 1
VAL [E_1=1, E_M=2, M_E=2, T1_E=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647]
[L61] CALL immediate_notify()
VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647]
[L341] CALL activate_threads()
VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647]
[L312] int tmp ;
[L313] int tmp___0 ;
[L317] CALL, EXPR is_master_triggered()
[L121] int __retres1 ;
VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647]
[L124] COND FALSE !(m_pc == 1)
VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647]
[L134] __retres1 = 0
VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647]
[L136] return (__retres1);
VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, \result=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647]
[L317] RET, EXPR is_master_triggered()
[L317] tmp = is_master_triggered()
[L319] COND FALSE !(\read(tmp))
VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647]
[L325] CALL, EXPR is_transmit1_triggered()
[L140] int __retres1 ;
VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647]
[L143] COND TRUE t1_pc == 1
VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647]
[L144] COND TRUE E_1 == 1
[L145] __retres1 = 1
VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=1, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647]
[L155] return (__retres1);
VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, \result=1, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647]
[L325] RET, EXPR is_transmit1_triggered()
[L325] tmp___0 = is_transmit1_triggered()
[L327] COND TRUE \read(tmp___0)
[L328] t1_st = 0
VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, token=2147483647]
[L341] RET activate_threads()
VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, token=2147483647]
[L61] RET immediate_notify()
VAL [E_1=1, E_M=2, M_E=2, T1_E=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, token=2147483647]
[L62] E_1 = 2
[L63] m_pc = 1
[L64] m_st = 2
VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=2147483647, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0, token=2147483647]
[L226] RET master()
[L234] COND TRUE t1_st == 0
[L235] int tmp_ndt_2;
[L236] tmp_ndt_2 = __VERIFIER_nondet_int()
[L237] COND TRUE \read(tmp_ndt_2)
[L239] t1_st = 1
[L240] CALL transmit1()
[L88] COND FALSE !(t1_pc == 0)
VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=2147483647, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=2147483647]
[L91] COND TRUE t1_pc == 1
VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=2147483647, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=2147483647]
[L107] token += 1
VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=2147483647, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=2147483647]
- UnprovableResult [Line: 69]: Unable to prove that integer overflow can never occur
Unable to prove that integer overflow can never occur
Reason: Not analyzed.
- UnprovableResult [Line: 69]: Unable to prove that integer overflow can never occur
Unable to prove that integer overflow can never occur
Reason: Not analyzed.
- UnprovableResult [Line: 107]: Unable to prove that integer overflow can never occur
Unable to prove that integer overflow can never occur
Reason: Not analyzed.
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 7 procedures, 116 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 16.1s, OverallIterations: 19, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6771 SdHoareTripleChecker+Valid, 6.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6588 mSDsluCounter, 8332 SdHoareTripleChecker+Invalid, 5.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6095 mSDsCounter, 1227 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7756 IncrementalHoareTripleChecker+Invalid, 8983 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1227 mSolverCounterUnsat, 2237 mSDtfsCounter, 7756 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 493 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 534 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3838occurred in iteration=14, InterpolantAutomatonStates: 214, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.4s AutomataMinimizationTime, 18 MinimizatonAttempts, 4230 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1279 NumberOfCodeBlocks, 1279 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1160 ConstructedInterpolants, 0 QuantifiedInterpolants, 2539 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 121/121 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
[2024-11-07 20:59:59,458 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
Writing output log to file Ultimate.log
Writing human readable error path to file UltimateCounterExample.errorpath
Result:
FALSE(OVERFLOW)