/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_DEAD -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 00:02:30,127 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 00:02:30,128 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 00:02:30,151 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 00:02:30,151 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 00:02:30,152 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 00:02:30,153 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 00:02:30,155 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 00:02:30,156 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 00:02:30,157 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 00:02:30,158 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 00:02:30,159 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 00:02:30,159 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 00:02:30,160 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 00:02:30,161 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 00:02:30,161 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 00:02:30,162 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 00:02:30,163 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 00:02:30,164 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 00:02:30,165 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 00:02:30,167 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 00:02:30,168 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 00:02:30,169 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 00:02:30,169 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 00:02:30,172 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 00:02:30,173 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 00:02:30,173 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 00:02:30,174 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 00:02:30,174 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 00:02:30,175 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 00:02:30,175 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 00:02:30,176 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 00:02:30,177 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 00:02:30,177 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 00:02:30,178 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 00:02:30,178 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 00:02:30,179 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 00:02:30,179 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 00:02:30,180 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 00:02:30,180 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 00:02:30,181 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 00:02:30,182 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2022-12-13 00:02:30,200 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 00:02:30,201 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 00:02:30,201 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 00:02:30,201 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 00:02:30,202 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 00:02:30,202 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 00:02:30,202 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 00:02:30,202 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 00:02:30,203 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 00:02:30,203 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 00:02:30,203 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 00:02:30,203 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 00:02:30,203 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 00:02:30,203 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 00:02:30,203 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 00:02:30,204 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 00:02:30,204 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 00:02:30,204 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 00:02:30,204 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 00:02:30,204 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 00:02:30,204 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 00:02:30,204 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 00:02:30,204 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 00:02:30,205 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:02:30,205 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 00:02:30,205 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 00:02:30,205 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 00:02:30,205 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 00:02:30,205 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 00:02:30,205 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 00:02:30,206 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_DEAD [2022-12-13 00:02:30,518 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 00:02:30,536 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 00:02:30,538 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 00:02:30,538 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 00:02:30,539 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 00:02:30,540 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i [2022-12-13 00:02:31,633 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 00:02:31,862 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 00:02:31,863 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i [2022-12-13 00:02:31,893 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af59a65c1/eb502bc9572d4811aace595efb6847c7/FLAGfc4d1a5a4 [2022-12-13 00:02:31,910 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af59a65c1/eb502bc9572d4811aace595efb6847c7 [2022-12-13 00:02:31,913 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 00:02:31,916 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 00:02:31,919 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 00:02:31,919 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 00:02:31,922 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 00:02:31,922 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:02:31" (1/1) ... [2022-12-13 00:02:31,923 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e02f72f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:02:31, skipping insertion in model container [2022-12-13 00:02:31,924 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:02:31" (1/1) ... [2022-12-13 00:02:31,930 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 00:02:31,987 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 00:02:32,263 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i[30451,30464] [2022-12-13 00:02:32,272 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i[30681,30694] [2022-12-13 00:02:32,278 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i[30979,30992] [2022-12-13 00:02:32,288 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:02:32,300 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 00:02:32,332 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i[30451,30464] [2022-12-13 00:02:32,334 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i[30681,30694] [2022-12-13 00:02:32,335 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i[30979,30992] [2022-12-13 00:02:32,338 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:02:32,366 INFO L208 MainTranslator]: Completed translation [2022-12-13 00:02:32,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:02:32 WrapperNode [2022-12-13 00:02:32,380 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 00:02:32,381 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 00:02:32,381 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 00:02:32,381 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 00:02:32,385 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:02:32" (1/1) ... [2022-12-13 00:02:32,397 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:02:32" (1/1) ... [2022-12-13 00:02:32,417 INFO L138 Inliner]: procedures = 168, calls = 36, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 142 [2022-12-13 00:02:32,417 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 00:02:32,418 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 00:02:32,418 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 00:02:32,418 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 00:02:32,425 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:02:32" (1/1) ... [2022-12-13 00:02:32,425 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:02:32" (1/1) ... [2022-12-13 00:02:32,430 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:02:32" (1/1) ... [2022-12-13 00:02:32,430 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:02:32" (1/1) ... [2022-12-13 00:02:32,435 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:02:32" (1/1) ... [2022-12-13 00:02:32,438 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:02:32" (1/1) ... [2022-12-13 00:02:32,440 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:02:32" (1/1) ... [2022-12-13 00:02:32,441 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:02:32" (1/1) ... [2022-12-13 00:02:32,443 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 00:02:32,444 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 00:02:32,444 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 00:02:32,444 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 00:02:32,445 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:02:32" (1/1) ... [2022-12-13 00:02:32,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:02:32,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:02:32,483 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 00:02:32,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 00:02:32,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 00:02:32,513 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-13 00:02:32,513 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-13 00:02:32,513 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-13 00:02:32,513 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-13 00:02:32,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 00:02:32,514 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-13 00:02:32,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 00:02:32,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 00:02:32,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 00:02:32,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-12-13 00:02:32,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 00:02:32,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 00:02:32,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 00:02:32,515 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 00:02:32,645 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 00:02:32,646 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 00:02:32,957 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 00:02:32,963 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 00:02:32,963 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-13 00:02:32,965 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:02:32 BoogieIcfgContainer [2022-12-13 00:02:32,965 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 00:02:32,967 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 00:02:32,967 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 00:02:32,969 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 00:02:32,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:02:31" (1/3) ... [2022-12-13 00:02:32,970 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3508cb34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:02:32, skipping insertion in model container [2022-12-13 00:02:32,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:02:32" (2/3) ... [2022-12-13 00:02:32,970 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3508cb34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:02:32, skipping insertion in model container [2022-12-13 00:02:32,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:02:32" (3/3) ... [2022-12-13 00:02:32,972 INFO L112 eAbstractionObserver]: Analyzing ICFG circular_buffer_ok.i [2022-12-13 00:02:32,986 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 00:02:32,986 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-12-13 00:02:32,986 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 00:02:33,068 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-13 00:02:33,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 148 transitions, 312 flow [2022-12-13 00:02:33,172 INFO L130 PetriNetUnfolder]: 11/146 cut-off events. [2022-12-13 00:02:33,173 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 00:02:33,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 146 events. 11/146 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 281 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 94. Up to 2 conditions per place. [2022-12-13 00:02:33,179 INFO L82 GeneralOperation]: Start removeDead. Operand has 144 places, 148 transitions, 312 flow [2022-12-13 00:02:33,184 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 133 places, 137 transitions, 283 flow [2022-12-13 00:02:33,186 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:02:33,202 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 137 transitions, 283 flow [2022-12-13 00:02:33,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 137 transitions, 283 flow [2022-12-13 00:02:33,251 INFO L130 PetriNetUnfolder]: 11/137 cut-off events. [2022-12-13 00:02:33,251 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 00:02:33,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 137 events. 11/137 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 266 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 94. Up to 2 conditions per place. [2022-12-13 00:02:33,257 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 137 transitions, 283 flow [2022-12-13 00:02:33,258 INFO L226 LiptonReduction]: Number of co-enabled transitions 4498 [2022-12-13 00:02:42,607 INFO L241 LiptonReduction]: Total number of compositions: 113 [2022-12-13 00:02:42,620 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 00:02:42,625 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@15053c1c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 00:02:42,625 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-12-13 00:02:42,629 INFO L130 PetriNetUnfolder]: 1/22 cut-off events. [2022-12-13 00:02:42,629 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:02:42,629 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:02:42,629 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2022-12-13 00:02:42,630 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-12-13 00:02:42,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:02:42,633 INFO L85 PathProgramCache]: Analyzing trace with hash 19165804, now seen corresponding path program 1 times [2022-12-13 00:02:42,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:02:42,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503489011] [2022-12-13 00:02:42,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:02:42,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:02:42,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:02:42,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:02:42,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:02:42,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503489011] [2022-12-13 00:02:42,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503489011] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:02:42,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:02:42,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:02:42,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434180836] [2022-12-13 00:02:42,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:02:42,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 00:02:42,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:02:42,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 00:02:42,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 00:02:42,882 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 99 [2022-12-13 00:02:42,884 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 99 transitions, 207 flow. Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:02:42,884 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:02:42,884 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 99 [2022-12-13 00:02:42,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:02:43,390 INFO L130 PetriNetUnfolder]: 4126/6923 cut-off events. [2022-12-13 00:02:43,390 INFO L131 PetriNetUnfolder]: For 96/96 co-relation queries the response was YES. [2022-12-13 00:02:43,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13333 conditions, 6923 events. 4126/6923 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 773. Compared 48536 event pairs, 3532 based on Foata normal form. 0/2324 useless extension candidates. Maximal degree in co-relation 13054. Up to 6325 conditions per place. [2022-12-13 00:02:43,421 INFO L137 encePairwiseOnDemand]: 87/99 looper letters, 68 selfloop transitions, 0 changer transitions 0/87 dead transitions. [2022-12-13 00:02:43,421 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 87 transitions, 319 flow [2022-12-13 00:02:43,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 00:02:43,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 00:02:43,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 118 transitions. [2022-12-13 00:02:43,432 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5959595959595959 [2022-12-13 00:02:43,435 INFO L295 CegarLoopForPetriNet]: 95 programPoint places, -8 predicate places. [2022-12-13 00:02:43,435 INFO L82 GeneralOperation]: Start removeDead. Operand has 87 places, 87 transitions, 319 flow [2022-12-13 00:02:43,453 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 87 places, 87 transitions, 319 flow [2022-12-13 00:02:43,455 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 87 transitions, 319 flow [2022-12-13 00:02:43,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:02:43,455 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:02:43,455 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-13 00:02:43,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 00:02:43,456 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-12-13 00:02:43,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:02:43,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1238343421, now seen corresponding path program 1 times [2022-12-13 00:02:43,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:02:43,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672071408] [2022-12-13 00:02:43,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:02:43,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:02:43,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:02:43,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:02:43,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:02:43,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672071408] [2022-12-13 00:02:43,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672071408] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:02:43,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:02:43,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:02:43,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706444224] [2022-12-13 00:02:43,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:02:43,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:02:43,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:02:43,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:02:43,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:02:43,674 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 99 [2022-12-13 00:02:43,674 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 87 transitions, 319 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:02:43,674 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:02:43,675 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 99 [2022-12-13 00:02:43,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:02:44,317 INFO L130 PetriNetUnfolder]: 5960/10012 cut-off events. [2022-12-13 00:02:44,317 INFO L131 PetriNetUnfolder]: For 238/298 co-relation queries the response was YES. [2022-12-13 00:02:44,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28399 conditions, 10012 events. 5960/10012 cut-off events. For 238/298 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 69318 event pairs, 2122 based on Foata normal form. 0/3560 useless extension candidates. Maximal degree in co-relation 27725. Up to 9052 conditions per place. [2022-12-13 00:02:44,381 INFO L137 encePairwiseOnDemand]: 89/99 looper letters, 112 selfloop transitions, 4 changer transitions 0/134 dead transitions. [2022-12-13 00:02:44,382 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 134 transitions, 743 flow [2022-12-13 00:02:44,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:02:44,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:02:44,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 176 transitions. [2022-12-13 00:02:44,384 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5925925925925926 [2022-12-13 00:02:44,384 INFO L295 CegarLoopForPetriNet]: 95 programPoint places, -6 predicate places. [2022-12-13 00:02:44,385 INFO L82 GeneralOperation]: Start removeDead. Operand has 89 places, 134 transitions, 743 flow [2022-12-13 00:02:44,411 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 89 places, 134 transitions, 743 flow [2022-12-13 00:02:44,412 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 134 transitions, 743 flow [2022-12-13 00:02:44,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:02:44,412 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:02:44,412 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:02:44,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 00:02:44,413 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-12-13 00:02:44,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:02:44,413 INFO L85 PathProgramCache]: Analyzing trace with hash -266073765, now seen corresponding path program 1 times [2022-12-13 00:02:44,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:02:44,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707859750] [2022-12-13 00:02:44,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:02:44,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:02:44,429 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-13 00:02:44,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1144076745] [2022-12-13 00:02:44,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:02:44,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:02:44,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:02:44,446 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 00:02:44,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 00:02:44,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:02:44,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 00:02:44,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:02:44,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:02:44,563 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 00:02:44,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:02:44,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707859750] [2022-12-13 00:02:44,564 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-13 00:02:44,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144076745] [2022-12-13 00:02:44,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1144076745] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:02:44,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:02:44,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:02:44,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935323230] [2022-12-13 00:02:44,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:02:44,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:02:44,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:02:44,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:02:44,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:02:44,566 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 99 [2022-12-13 00:02:44,566 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 134 transitions, 743 flow. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:02:44,566 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:02:44,566 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 99 [2022-12-13 00:02:44,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:02:45,444 INFO L130 PetriNetUnfolder]: 7253/11832 cut-off events. [2022-12-13 00:02:45,445 INFO L131 PetriNetUnfolder]: For 880/1000 co-relation queries the response was YES. [2022-12-13 00:02:45,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44440 conditions, 11832 events. 7253/11832 cut-off events. For 880/1000 co-relation queries the response was YES. Maximal size of possible extension queue 633. Compared 80342 event pairs, 1702 based on Foata normal form. 0/4271 useless extension candidates. Maximal degree in co-relation 43573. Up to 10665 conditions per place. [2022-12-13 00:02:45,486 INFO L137 encePairwiseOnDemand]: 85/99 looper letters, 208 selfloop transitions, 15 changer transitions 0/241 dead transitions. [2022-12-13 00:02:45,487 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 241 transitions, 1836 flow [2022-12-13 00:02:45,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:02:45,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:02:45,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 221 transitions. [2022-12-13 00:02:45,489 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5580808080808081 [2022-12-13 00:02:45,489 INFO L295 CegarLoopForPetriNet]: 95 programPoint places, -3 predicate places. [2022-12-13 00:02:45,490 INFO L82 GeneralOperation]: Start removeDead. Operand has 92 places, 241 transitions, 1836 flow [2022-12-13 00:02:45,523 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 92 places, 241 transitions, 1836 flow [2022-12-13 00:02:45,524 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 241 transitions, 1836 flow [2022-12-13 00:02:45,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:02:45,524 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:02:45,524 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:02:45,543 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-13 00:02:45,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:02:45,731 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-12-13 00:02:45,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:02:45,732 INFO L85 PathProgramCache]: Analyzing trace with hash 192870542, now seen corresponding path program 1 times [2022-12-13 00:02:45,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:02:45,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067861559] [2022-12-13 00:02:45,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:02:45,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:02:45,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:02:45,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:02:45,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:02:45,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067861559] [2022-12-13 00:02:45,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067861559] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:02:45,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:02:45,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:02:45,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831200323] [2022-12-13 00:02:45,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:02:45,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:02:45,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:02:45,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:02:45,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:02:45,814 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 99 [2022-12-13 00:02:45,814 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 241 transitions, 1836 flow. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:02:45,814 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:02:45,814 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 99 [2022-12-13 00:02:45,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:02:46,873 INFO L130 PetriNetUnfolder]: 8575/13997 cut-off events. [2022-12-13 00:02:46,874 INFO L131 PetriNetUnfolder]: For 3141/3162 co-relation queries the response was YES. [2022-12-13 00:02:46,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64757 conditions, 13997 events. 8575/13997 cut-off events. For 3141/3162 co-relation queries the response was YES. Maximal size of possible extension queue 809. Compared 96378 event pairs, 1272 based on Foata normal form. 302/5518 useless extension candidates. Maximal degree in co-relation 63662. Up to 12437 conditions per place. [2022-12-13 00:02:46,916 INFO L137 encePairwiseOnDemand]: 85/99 looper letters, 241 selfloop transitions, 3 changer transitions 45/306 dead transitions. [2022-12-13 00:02:46,917 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 306 transitions, 2935 flow [2022-12-13 00:02:46,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:02:46,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:02:46,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 177 transitions. [2022-12-13 00:02:46,918 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5959595959595959 [2022-12-13 00:02:46,919 INFO L295 CegarLoopForPetriNet]: 95 programPoint places, -1 predicate places. [2022-12-13 00:02:46,919 INFO L82 GeneralOperation]: Start removeDead. Operand has 94 places, 306 transitions, 2935 flow [2022-12-13 00:02:46,949 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 93 places, 261 transitions, 2482 flow [2022-12-13 00:02:46,949 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 261 transitions, 2482 flow [2022-12-13 00:02:46,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:02:46,949 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:02:46,950 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:02:46,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 00:02:46,950 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-12-13 00:02:46,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:02:46,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1719353384, now seen corresponding path program 1 times [2022-12-13 00:02:46,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:02:46,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395788872] [2022-12-13 00:02:46,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:02:46,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:02:46,966 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-13 00:02:46,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1315296596] [2022-12-13 00:02:46,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:02:46,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:02:46,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:02:46,972 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 00:02:46,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 00:02:47,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:02:47,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 00:02:47,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:02:47,092 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:02:47,092 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 00:02:47,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:02:47,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395788872] [2022-12-13 00:02:47,093 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-13 00:02:47,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315296596] [2022-12-13 00:02:47,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1315296596] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:02:47,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:02:47,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:02:47,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94529012] [2022-12-13 00:02:47,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:02:47,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:02:47,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:02:47,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:02:47,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:02:47,094 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 99 [2022-12-13 00:02:47,095 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 261 transitions, 2482 flow. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:02:47,095 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:02:47,096 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 99 [2022-12-13 00:02:47,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:02:47,784 INFO L130 PetriNetUnfolder]: 5597/9633 cut-off events. [2022-12-13 00:02:47,785 INFO L131 PetriNetUnfolder]: For 3578/3615 co-relation queries the response was YES. [2022-12-13 00:02:47,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52204 conditions, 9633 events. 5597/9633 cut-off events. For 3578/3615 co-relation queries the response was YES. Maximal size of possible extension queue 599. Compared 67857 event pairs, 649 based on Foata normal form. 0/4076 useless extension candidates. Maximal degree in co-relation 51320. Up to 8448 conditions per place. [2022-12-13 00:02:47,878 INFO L137 encePairwiseOnDemand]: 96/99 looper letters, 117 selfloop transitions, 1 changer transitions 112/248 dead transitions. [2022-12-13 00:02:47,878 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 248 transitions, 2816 flow [2022-12-13 00:02:47,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:02:47,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:02:47,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2022-12-13 00:02:47,880 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4006734006734007 [2022-12-13 00:02:47,881 INFO L295 CegarLoopForPetriNet]: 95 programPoint places, -4 predicate places. [2022-12-13 00:02:47,881 INFO L82 GeneralOperation]: Start removeDead. Operand has 91 places, 248 transitions, 2816 flow [2022-12-13 00:02:47,902 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 69 places, 136 transitions, 1480 flow [2022-12-13 00:02:47,902 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 136 transitions, 1480 flow [2022-12-13 00:02:47,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:02:47,902 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:02:47,902 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:02:47,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-13 00:02:48,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:02:48,110 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-12-13 00:02:48,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:02:48,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1869343564, now seen corresponding path program 1 times [2022-12-13 00:02:48,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:02:48,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704328072] [2022-12-13 00:02:48,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:02:48,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:02:48,125 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-13 00:02:48,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1371108574] [2022-12-13 00:02:48,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:02:48,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:02:48,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:02:48,127 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 00:02:48,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 00:02:48,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:02:48,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 00:02:48,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:02:48,229 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 00:02:48,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:02:48,236 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 00:02:48,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:02:48,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704328072] [2022-12-13 00:02:48,237 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-13 00:02:48,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371108574] [2022-12-13 00:02:48,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1371108574] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:02:48,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:02:48,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:02:48,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850217141] [2022-12-13 00:02:48,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:02:48,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:02:48,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:02:48,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:02:48,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:02:48,240 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 99 [2022-12-13 00:02:48,240 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 136 transitions, 1480 flow. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:02:48,240 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:02:48,240 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 99 [2022-12-13 00:02:48,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:02:48,397 INFO L130 PetriNetUnfolder]: 988/2009 cut-off events. [2022-12-13 00:02:48,397 INFO L131 PetriNetUnfolder]: For 2444/2444 co-relation queries the response was YES. [2022-12-13 00:02:48,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11727 conditions, 2009 events. 988/2009 cut-off events. For 2444/2444 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 12327 event pairs, 73 based on Foata normal form. 105/1419 useless extension candidates. Maximal degree in co-relation 11376. Up to 1574 conditions per place. [2022-12-13 00:02:48,404 INFO L137 encePairwiseOnDemand]: 88/99 looper letters, 82 selfloop transitions, 26 changer transitions 23/146 dead transitions. [2022-12-13 00:02:48,405 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 146 transitions, 1870 flow [2022-12-13 00:02:48,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:02:48,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:02:48,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2022-12-13 00:02:48,406 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2022-12-13 00:02:48,406 INFO L295 CegarLoopForPetriNet]: 95 programPoint places, -24 predicate places. [2022-12-13 00:02:48,406 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 146 transitions, 1870 flow [2022-12-13 00:02:48,412 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 123 transitions, 1566 flow [2022-12-13 00:02:48,412 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 123 transitions, 1566 flow [2022-12-13 00:02:48,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:02:48,412 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:02:48,412 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:02:48,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-13 00:02:48,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:02:48,620 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-12-13 00:02:48,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:02:48,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1347036156, now seen corresponding path program 1 times [2022-12-13 00:02:48,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:02:48,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173091302] [2022-12-13 00:02:48,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:02:48,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:02:48,636 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-13 00:02:48,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [683256759] [2022-12-13 00:02:48,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:02:48,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:02:48,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:02:48,656 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 00:02:48,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 00:02:48,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:02:48,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 00:02:48,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:02:49,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:02:49,023 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 00:02:49,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:02:49,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173091302] [2022-12-13 00:02:49,024 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-13 00:02:49,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683256759] [2022-12-13 00:02:49,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [683256759] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:02:49,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:02:49,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:02:49,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747884275] [2022-12-13 00:02:49,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:02:49,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:02:49,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:02:49,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:02:49,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:02:49,028 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 99 [2022-12-13 00:02:49,028 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 123 transitions, 1566 flow. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:02:49,028 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:02:49,028 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 99 [2022-12-13 00:02:49,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:02:49,312 INFO L130 PetriNetUnfolder]: 1099/2124 cut-off events. [2022-12-13 00:02:49,313 INFO L131 PetriNetUnfolder]: For 3414/3414 co-relation queries the response was YES. [2022-12-13 00:02:49,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13943 conditions, 2124 events. 1099/2124 cut-off events. For 3414/3414 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 12189 event pairs, 73 based on Foata normal form. 0/1496 useless extension candidates. Maximal degree in co-relation 13389. Up to 1635 conditions per place. [2022-12-13 00:02:49,323 INFO L137 encePairwiseOnDemand]: 95/99 looper letters, 157 selfloop transitions, 5 changer transitions 0/179 dead transitions. [2022-12-13 00:02:49,323 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 179 transitions, 2695 flow [2022-12-13 00:02:49,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:02:49,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:02:49,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2022-12-13 00:02:49,324 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3434343434343434 [2022-12-13 00:02:49,325 INFO L295 CegarLoopForPetriNet]: 95 programPoint places, -33 predicate places. [2022-12-13 00:02:49,325 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 179 transitions, 2695 flow [2022-12-13 00:02:49,332 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 179 transitions, 2695 flow [2022-12-13 00:02:49,332 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 179 transitions, 2695 flow [2022-12-13 00:02:49,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:02:49,332 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:02:49,332 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:02:49,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-13 00:02:49,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:02:49,541 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-12-13 00:02:49,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:02:49,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1191547075, now seen corresponding path program 1 times [2022-12-13 00:02:49,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:02:49,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416549460] [2022-12-13 00:02:49,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:02:49,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:02:49,555 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-13 00:02:49,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1003937971] [2022-12-13 00:02:49,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:02:49,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:02:49,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:02:49,572 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 00:02:49,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 00:02:49,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:02:49,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-13 00:02:49,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:02:49,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 00:02:49,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 12 [2022-12-13 00:02:49,973 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-13 00:02:49,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-12-13 00:02:50,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-12-13 00:02:50,086 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 45 [2022-12-13 00:02:50,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2022-12-13 00:02:50,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:02:50,240 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 00:02:50,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:02:50,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416549460] [2022-12-13 00:02:50,241 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-13 00:02:50,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003937971] [2022-12-13 00:02:50,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003937971] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:02:50,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:02:50,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 00:02:50,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372299141] [2022-12-13 00:02:50,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:02:50,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 00:02:50,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:02:50,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 00:02:50,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 00:02:50,242 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 99 [2022-12-13 00:02:50,242 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 179 transitions, 2695 flow. Second operand has 7 states, 7 states have (on average 18.0) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:02:50,242 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:02:50,242 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 99 [2022-12-13 00:02:50,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:02:50,698 INFO L130 PetriNetUnfolder]: 1827/3458 cut-off events. [2022-12-13 00:02:50,698 INFO L131 PetriNetUnfolder]: For 9264/9264 co-relation queries the response was YES. [2022-12-13 00:02:50,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25552 conditions, 3458 events. 1827/3458 cut-off events. For 9264/9264 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 21574 event pairs, 97 based on Foata normal form. 6/2479 useless extension candidates. Maximal degree in co-relation 24537. Up to 2658 conditions per place. [2022-12-13 00:02:50,712 INFO L137 encePairwiseOnDemand]: 90/99 looper letters, 221 selfloop transitions, 10 changer transitions 45/290 dead transitions. [2022-12-13 00:02:50,712 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 290 transitions, 4995 flow [2022-12-13 00:02:50,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:02:50,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:02:50,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 186 transitions. [2022-12-13 00:02:50,713 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.31313131313131315 [2022-12-13 00:02:50,714 INFO L295 CegarLoopForPetriNet]: 95 programPoint places, -28 predicate places. [2022-12-13 00:02:50,714 INFO L82 GeneralOperation]: Start removeDead. Operand has 67 places, 290 transitions, 4995 flow [2022-12-13 00:02:50,725 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 64 places, 245 transitions, 4262 flow [2022-12-13 00:02:50,726 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 245 transitions, 4262 flow [2022-12-13 00:02:50,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.0) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:02:50,726 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:02:50,726 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:02:50,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-13 00:02:50,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:02:50,931 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-12-13 00:02:50,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:02:50,932 INFO L85 PathProgramCache]: Analyzing trace with hash 541339509, now seen corresponding path program 1 times [2022-12-13 00:02:50,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:02:50,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011714669] [2022-12-13 00:02:50,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:02:50,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:02:50,947 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-13 00:02:50,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [590868516] [2022-12-13 00:02:50,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:02:50,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:02:50,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:02:50,954 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 00:02:50,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 00:02:51,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:02:51,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 00:02:51,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:02:51,081 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:02:51,081 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 00:02:51,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:02:51,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011714669] [2022-12-13 00:02:51,081 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-13 00:02:51,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590868516] [2022-12-13 00:02:51,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [590868516] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:02:51,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:02:51,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:02:51,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240207096] [2022-12-13 00:02:51,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:02:51,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:02:51,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:02:51,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:02:51,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:02:51,082 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 99 [2022-12-13 00:02:51,082 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 245 transitions, 4262 flow. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:02:51,082 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:02:51,082 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 99 [2022-12-13 00:02:51,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:02:51,334 INFO L130 PetriNetUnfolder]: 900/1720 cut-off events. [2022-12-13 00:02:51,334 INFO L131 PetriNetUnfolder]: For 6238/6238 co-relation queries the response was YES. [2022-12-13 00:02:51,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14327 conditions, 1720 events. 900/1720 cut-off events. For 6238/6238 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 8270 event pairs, 28 based on Foata normal form. 80/1328 useless extension candidates. Maximal degree in co-relation 13905. Up to 1355 conditions per place. [2022-12-13 00:02:51,341 INFO L137 encePairwiseOnDemand]: 94/99 looper letters, 140 selfloop transitions, 2 changer transitions 48/201 dead transitions. [2022-12-13 00:02:51,341 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 201 transitions, 3834 flow [2022-12-13 00:02:51,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:02:51,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:02:51,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2022-12-13 00:02:51,342 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3063973063973064 [2022-12-13 00:02:51,343 INFO L295 CegarLoopForPetriNet]: 95 programPoint places, -29 predicate places. [2022-12-13 00:02:51,343 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 201 transitions, 3834 flow [2022-12-13 00:02:51,349 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 65 places, 153 transitions, 2878 flow [2022-12-13 00:02:51,349 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 153 transitions, 2878 flow [2022-12-13 00:02:51,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:02:51,349 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:02:51,349 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:02:51,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-13 00:02:51,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:02:51,559 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-12-13 00:02:51,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:02:51,559 INFO L85 PathProgramCache]: Analyzing trace with hash 558132150, now seen corresponding path program 1 times [2022-12-13 00:02:51,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:02:51,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247557943] [2022-12-13 00:02:51,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:02:51,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:02:51,573 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-13 00:02:51,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1030802237] [2022-12-13 00:02:51,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:02:51,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:02:51,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:02:51,574 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 00:02:51,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 00:02:51,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:02:51,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-13 00:02:51,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:02:51,961 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:02:51,961 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 00:02:53,160 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:02:53,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:02:53,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247557943] [2022-12-13 00:02:53,160 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-13 00:02:53,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030802237] [2022-12-13 00:02:53,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030802237] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 00:02:53,160 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 00:02:53,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2022-12-13 00:02:53,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92651620] [2022-12-13 00:02:53,160 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 00:02:53,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 00:02:53,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:02:53,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 00:02:53,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-12-13 00:02:53,161 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 99 [2022-12-13 00:02:53,162 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 153 transitions, 2878 flow. Second operand has 10 states, 10 states have (on average 22.5) internal successors, (225), 10 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:02:53,162 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:02:53,162 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 99 [2022-12-13 00:02:53,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:03:06,022 INFO L130 PetriNetUnfolder]: 1782/3434 cut-off events. [2022-12-13 00:03:06,023 INFO L131 PetriNetUnfolder]: For 13070/13070 co-relation queries the response was YES. [2022-12-13 00:03:06,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31297 conditions, 3434 events. 1782/3434 cut-off events. For 13070/13070 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 16294 event pairs, 73 based on Foata normal form. 0/2423 useless extension candidates. Maximal degree in co-relation 30803. Up to 2709 conditions per place. [2022-12-13 00:03:06,038 INFO L137 encePairwiseOnDemand]: 95/99 looper letters, 299 selfloop transitions, 12 changer transitions 0/324 dead transitions. [2022-12-13 00:03:06,039 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 324 transitions, 6944 flow [2022-12-13 00:03:06,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 00:03:06,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 00:03:06,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 318 transitions. [2022-12-13 00:03:06,040 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3212121212121212 [2022-12-13 00:03:06,041 INFO L295 CegarLoopForPetriNet]: 95 programPoint places, -21 predicate places. [2022-12-13 00:03:06,041 INFO L82 GeneralOperation]: Start removeDead. Operand has 74 places, 324 transitions, 6944 flow [2022-12-13 00:03:06,054 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 74 places, 324 transitions, 6944 flow [2022-12-13 00:03:06,055 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 324 transitions, 6944 flow [2022-12-13 00:03:06,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 22.5) internal successors, (225), 10 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:03:06,055 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:03:06,055 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:03:06,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-13 00:03:06,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:03:06,262 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-12-13 00:03:06,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:03:06,262 INFO L85 PathProgramCache]: Analyzing trace with hash 122222417, now seen corresponding path program 1 times [2022-12-13 00:03:06,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:03:06,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426798783] [2022-12-13 00:03:06,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:03:06,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:03:06,282 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-13 00:03:06,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1557614339] [2022-12-13 00:03:06,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:03:06,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:03:06,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:03:06,288 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 00:03:06,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 00:03:06,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:03:06,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-13 00:03:06,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:03:06,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 00:03:06,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-13 00:03:06,953 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:03:06,953 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 00:03:07,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-13 00:03:07,134 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 00:03:07,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 76 [2022-12-13 00:03:07,178 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 00:03:07,180 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 122 [2022-12-13 00:03:07,221 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 00:03:07,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 170 treesize of output 135 [2022-12-13 00:03:15,082 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:03:15,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:03:15,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426798783] [2022-12-13 00:03:15,083 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-13 00:03:15,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557614339] [2022-12-13 00:03:15,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557614339] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 00:03:15,083 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 00:03:15,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 20 [2022-12-13 00:03:15,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844846839] [2022-12-13 00:03:15,083 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 00:03:15,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-13 00:03:15,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:03:15,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-13 00:03:15,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2022-12-13 00:03:15,085 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 99 [2022-12-13 00:03:15,085 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 324 transitions, 6944 flow. Second operand has 22 states, 22 states have (on average 14.454545454545455) internal successors, (318), 22 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:03:15,085 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:03:15,085 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 99 [2022-12-13 00:03:15,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:03:52,119 WARN L233 SmtUtils]: Spent 8.04s on a formula simplification. DAG size of input: 79 DAG size of output: 74 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 00:04:22,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-12-13 00:04:27,874 INFO L130 PetriNetUnfolder]: 3370/6602 cut-off events. [2022-12-13 00:04:27,874 INFO L131 PetriNetUnfolder]: For 32978/32978 co-relation queries the response was YES. [2022-12-13 00:04:27,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65146 conditions, 6602 events. 3370/6602 cut-off events. For 32978/32978 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 35527 event pairs, 39 based on Foata normal form. 24/4821 useless extension candidates. Maximal degree in co-relation 62340. Up to 5141 conditions per place. [2022-12-13 00:04:27,897 INFO L137 encePairwiseOnDemand]: 82/99 looper letters, 480 selfloop transitions, 125 changer transitions 236/851 dead transitions. [2022-12-13 00:04:27,897 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 851 transitions, 19870 flow [2022-12-13 00:04:27,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-12-13 00:04:27,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2022-12-13 00:04:27,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 1020 transitions. [2022-12-13 00:04:27,902 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.19439679817038308 [2022-12-13 00:04:27,902 INFO L295 CegarLoopForPetriNet]: 95 programPoint places, 31 predicate places. [2022-12-13 00:04:27,902 INFO L82 GeneralOperation]: Start removeDead. Operand has 126 places, 851 transitions, 19870 flow [2022-12-13 00:04:27,922 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 615 transitions, 14350 flow [2022-12-13 00:04:27,922 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 615 transitions, 14350 flow [2022-12-13 00:04:27,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 14.454545454545455) internal successors, (318), 22 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:04:27,922 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:04:27,922 INFO L214 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:04:27,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-13 00:04:28,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-13 00:04:28,127 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-12-13 00:04:28,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:04:28,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1029098866, now seen corresponding path program 2 times [2022-12-13 00:04:28,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:04:28,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471696288] [2022-12-13 00:04:28,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:04:28,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:04:28,144 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-13 00:04:28,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [489356094] [2022-12-13 00:04:28,145 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 00:04:28,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:04:28,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:04:28,146 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 00:04:28,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 00:04:29,147 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 00:04:29,148 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 00:04:29,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 108 conjunts are in the unsatisfiable core [2022-12-13 00:04:29,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 00:04:29,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 00:04:29,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 12 [2022-12-13 00:04:29,190 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-13 00:04:29,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-12-13 00:04:29,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-12-13 00:04:29,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 45 [2022-12-13 00:04:29,669 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 77 [2022-12-13 00:04:30,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 74 [2022-12-13 00:04:42,942 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 77 [2022-12-13 00:04:53,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 74 [2022-12-13 00:05:01,521 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 4 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:05:01,522 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 00:05:28,272 WARN L233 SmtUtils]: Spent 10.47s on a formula simplification. DAG size of input: 70 DAG size of output: 54 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 00:11:14,112 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse118 (mod (+ c_~first~0 1) 4294967296)) (.cse119 (mod c_~first~0 4294967296))) (let ((.cse0 (<= .cse119 2147483647)) (.cse15 (<= .cse118 2147483647))) (let ((.cse11 (+ |c_~#buffer~0.offset| .cse119 (- 4294967296))) (.cse24 (+ |c_~#buffer~0.offset| .cse118 (- 4294967296))) (.cse1 (not .cse15)) (.cse33 (+ |c_~#buffer~0.offset| .cse119)) (.cse12 (+ |c_t1Thread1of1ForFork1_~i~0#1| 1)) (.cse13 (+ |c_~#buffer~0.offset| .cse118)) (.cse8 (mod c_~buffer_size~0 4294967296)) (.cse14 (select |c_#memory_int| |c_~#buffer~0.base|)) (.cse34 (not .cse0))) (and (or .cse0 (and (or .cse1 (forall ((aux_div_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 Int) (aux_div_aux_mod_aux_mod_~next~0_30_35_46 Int) (aux_div_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57 Int) (aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 Int) (aux_div_aux_mod_~next~0_30_35 Int) (v_ArrVal_834 Int) (v_ArrVal_831 Int)) (let ((.cse6 (* aux_div_aux_mod_aux_mod_~next~0_30_35_46 4294967296)) (.cse7 (* 4294967296 aux_div_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57)) (.cse5 (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 4294967296))) (let ((.cse10 (store .cse14 (+ |c_~#buffer~0.offset| (- 4294967296) (mod aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 4294967296)) v_ArrVal_831)) (.cse3 (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse5)) (.cse2 (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse5 .cse6 .cse7 (* aux_div_aux_mod_~next~0_30_35 4294967296))) (.cse4 (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse5 .cse6 .cse7)) (.cse9 (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse5 .cse7))) (or (<= 8589934591 .cse2) (< .cse3 4294967295) (<= 8589934591 .cse4) (<= (mod (mod (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse5 .cse6 .cse7 (- 4294967295)) .cse8) 4294967296) 0) (<= 8589934591 .cse9) (<= .cse8 (mod (mod (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse5 .cse7 (- 4294967295)) .cse8) 4294967296)) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse10 .cse11))) (not (= .cse12 (select (store .cse10 (+ |c_~#buffer~0.offset| (mod (mod (mod (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 1) 4294967296) .cse8) 4294967296)) v_ArrVal_834) .cse13))) (<= 8589934591 .cse3) (< 0 (mod (mod (mod (+ (mod (mod (+ (mod (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse5 (- 4294967295)) .cse8) 1) 4294967296) .cse8) 1) 4294967296) .cse8) 4294967296)) (< .cse2 4294967295) (< .cse4 4294967295) (< .cse9 4294967295) (<= aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 2147483647) (<= 4294967296 aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83)))))) (or .cse15 (forall ((aux_div_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 Int) (aux_div_aux_mod_aux_mod_~next~0_30_35_46 Int) (aux_div_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57 Int) (aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 Int) (aux_div_aux_mod_~next~0_30_35 Int) (v_ArrVal_834 Int) (v_ArrVal_831 Int)) (let ((.cse20 (* aux_div_aux_mod_aux_mod_~next~0_30_35_46 4294967296)) (.cse21 (* 4294967296 aux_div_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57)) (.cse19 (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 4294967296))) (let ((.cse17 (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse19)) (.cse23 (store .cse14 (+ |c_~#buffer~0.offset| (- 4294967296) (mod aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 4294967296)) v_ArrVal_831)) (.cse16 (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse19 .cse20 .cse21 (* aux_div_aux_mod_~next~0_30_35 4294967296))) (.cse18 (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse19 .cse20 .cse21)) (.cse22 (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse19 .cse21))) (or (<= 8589934591 .cse16) (< .cse17 4294967295) (<= 8589934591 .cse18) (<= (mod (mod (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse19 .cse20 .cse21 (- 4294967295)) .cse8) 4294967296) 0) (<= 8589934591 .cse22) (<= .cse8 (mod (mod (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse19 .cse21 (- 4294967295)) .cse8) 4294967296)) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse23 .cse11))) (<= 8589934591 .cse17) (< 0 (mod (mod (mod (+ (mod (mod (+ (mod (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse19 (- 4294967295)) .cse8) 1) 4294967296) .cse8) 1) 4294967296) .cse8) 4294967296)) (not (= (select (store .cse23 (+ |c_~#buffer~0.offset| (- 4294967296) (mod (mod (mod (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 1) 4294967296) .cse8) 4294967296)) v_ArrVal_834) .cse24) .cse12)) (< .cse16 4294967295) (< .cse18 4294967295) (< .cse22 4294967295) (<= aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 2147483647) (<= 4294967296 aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83)))))))) (or (and (or (forall ((aux_div_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 Int) (aux_div_aux_mod_aux_mod_~next~0_30_35_46 Int) (aux_div_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57 Int) (aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 Int) (aux_div_aux_mod_~next~0_30_35 Int) (v_ArrVal_834 Int) (v_ArrVal_831 Int)) (let ((.cse30 (* aux_div_aux_mod_aux_mod_~next~0_30_35_46 4294967296)) (.cse31 (* 4294967296 aux_div_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57)) (.cse29 (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 4294967296))) (let ((.cse27 (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse29)) (.cse26 (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse29 .cse30 .cse31 (* aux_div_aux_mod_~next~0_30_35 4294967296))) (.cse28 (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse29 .cse30 .cse31)) (.cse32 (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse29 .cse31)) (.cse25 (store .cse14 (+ |c_~#buffer~0.offset| (mod aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 4294967296)) v_ArrVal_831))) (or (not (= (select (store .cse25 (+ |c_~#buffer~0.offset| (mod (mod (mod (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 1) 4294967296) .cse8) 4294967296)) v_ArrVal_834) .cse13) .cse12)) (<= 8589934591 .cse26) (< .cse27 4294967295) (<= 8589934591 .cse28) (<= (mod (mod (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse29 .cse30 .cse31 (- 4294967295)) .cse8) 4294967296) 0) (<= 8589934591 .cse32) (<= .cse8 (mod (mod (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse29 .cse31 (- 4294967295)) .cse8) 4294967296)) (< aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 0) (<= 8589934591 .cse27) (< 0 (mod (mod (mod (+ (mod (mod (+ (mod (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse29 (- 4294967295)) .cse8) 1) 4294967296) .cse8) 1) 4294967296) .cse8) 4294967296)) (< .cse26 4294967295) (< 2147483647 aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83) (< .cse28 4294967295) (< .cse32 4294967295) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse25 .cse33))))))) .cse34) (or .cse0 (forall ((aux_div_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 Int) (aux_div_aux_mod_aux_mod_~next~0_30_35_46 Int) (aux_div_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57 Int) (aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 Int) (aux_div_aux_mod_~next~0_30_35 Int) (v_ArrVal_834 Int) (v_ArrVal_831 Int)) (let ((.cse40 (* aux_div_aux_mod_aux_mod_~next~0_30_35_46 4294967296)) (.cse41 (* 4294967296 aux_div_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57)) (.cse39 (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 4294967296))) (let ((.cse37 (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse39)) (.cse35 (store .cse14 (+ |c_~#buffer~0.offset| (mod aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 4294967296)) v_ArrVal_831)) (.cse36 (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse39 .cse40 .cse41 (* aux_div_aux_mod_~next~0_30_35 4294967296))) (.cse38 (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse39 .cse40 .cse41)) (.cse42 (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse39 .cse41))) (or (not (= (select (store .cse35 (+ |c_~#buffer~0.offset| (mod (mod (mod (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 1) 4294967296) .cse8) 4294967296)) v_ArrVal_834) .cse13) .cse12)) (<= 8589934591 .cse36) (< .cse37 4294967295) (<= 8589934591 .cse38) (<= (mod (mod (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse39 .cse40 .cse41 (- 4294967295)) .cse8) 4294967296) 0) (<= 8589934591 .cse42) (<= .cse8 (mod (mod (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse39 .cse41 (- 4294967295)) .cse8) 4294967296)) (< aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 0) (<= 8589934591 .cse37) (< 0 (mod (mod (mod (+ (mod (mod (+ (mod (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse39 (- 4294967295)) .cse8) 1) 4294967296) .cse8) 1) 4294967296) .cse8) 4294967296)) (not (= (select .cse35 .cse11) |c_t1Thread1of1ForFork1_~i~0#1|)) (< .cse36 4294967295) (< 2147483647 aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83) (< .cse38 4294967295) (< .cse42 4294967295))))))) .cse1) (or (< (mod (+ 2 c_~first~0) 4294967296) .cse8) (and (or (and (or .cse15 (forall ((aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 Int) (aux_div_aux_mod_aux_mod_~next~0_30_35_46 Int) (aux_div_aux_mod_~next~0_30_35 Int) (v_ArrVal_834 Int) (aux_div_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 Int) (v_ArrVal_831 Int)) (let ((.cse49 (* aux_div_aux_mod_~next~0_30_35 4294967296)) (.cse45 (* aux_div_aux_mod_aux_mod_~next~0_30_35_46 4294967296)) (.cse44 (* 4294967296 aux_div_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72))) (let ((.cse43 (store .cse14 (+ |c_~#buffer~0.offset| (mod aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 4294967296) (- 4294967296)) v_ArrVal_831)) (.cse47 (+ .cse44 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72)) (.cse46 (+ .cse44 .cse45 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72)) (.cse48 (+ .cse44 .cse45 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 .cse49))) (or (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse43 .cse33))) (<= (mod (mod (+ .cse44 .cse45 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 (- 4294967295)) .cse8) 4294967296) 0) (not (= (select (store .cse43 (+ |c_~#buffer~0.offset| (- 4294967296) (mod (mod (mod (+ aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 1) 4294967296) .cse8) 4294967296)) v_ArrVal_834) .cse24) .cse12)) (<= 8589934591 .cse46) (<= 4294967296 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72) (<= 8589934591 .cse47) (< .cse47 4294967295) (< .cse46 4294967295) (<= 8589934591 .cse48) (< .cse48 4294967295) (<= .cse8 (mod (mod (+ .cse44 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 (- 4294967295)) .cse8) 4294967296)) (<= (mod (mod (mod (+ (mod (+ .cse44 .cse45 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 (- 4294967295) .cse49) .cse8) 1) 4294967296) .cse8) 4294967296) 0) (<= aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 2147483647)))))) (or .cse1 (forall ((aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 Int) (aux_div_aux_mod_aux_mod_~next~0_30_35_46 Int) (aux_div_aux_mod_~next~0_30_35 Int) (v_ArrVal_834 Int) (aux_div_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 Int) (v_ArrVal_831 Int)) (let ((.cse56 (* aux_div_aux_mod_~next~0_30_35 4294967296)) (.cse52 (* aux_div_aux_mod_aux_mod_~next~0_30_35_46 4294967296)) (.cse51 (* 4294967296 aux_div_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72))) (let ((.cse54 (+ .cse51 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72)) (.cse53 (+ .cse51 .cse52 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72)) (.cse55 (+ .cse51 .cse52 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 .cse56)) (.cse50 (store .cse14 (+ |c_~#buffer~0.offset| (mod aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 4294967296) (- 4294967296)) v_ArrVal_831))) (or (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse50 .cse33))) (<= (mod (mod (+ .cse51 .cse52 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 (- 4294967295)) .cse8) 4294967296) 0) (<= 8589934591 .cse53) (<= 4294967296 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72) (<= 8589934591 .cse54) (< .cse54 4294967295) (< .cse53 4294967295) (<= 8589934591 .cse55) (< .cse55 4294967295) (not (= (select (store .cse50 (+ |c_~#buffer~0.offset| (mod (mod (mod (+ aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 1) 4294967296) .cse8) 4294967296)) v_ArrVal_834) .cse13) .cse12)) (<= .cse8 (mod (mod (+ .cse51 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 (- 4294967295)) .cse8) 4294967296)) (<= (mod (mod (mod (+ (mod (+ .cse51 .cse52 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 (- 4294967295) .cse56) .cse8) 1) 4294967296) .cse8) 4294967296) 0) (<= aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 2147483647))))))) .cse34) (or (forall ((aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 Int) (aux_div_aux_mod_aux_mod_~next~0_30_35_46 Int) (aux_div_aux_mod_~next~0_30_35 Int) (v_ArrVal_834 Int) (aux_div_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 Int) (v_ArrVal_831 Int)) (let ((.cse63 (* aux_div_aux_mod_~next~0_30_35 4294967296)) (.cse58 (* aux_div_aux_mod_aux_mod_~next~0_30_35_46 4294967296)) (.cse57 (* 4294967296 aux_div_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72))) (let ((.cse61 (+ .cse57 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72)) (.cse60 (store .cse14 (+ |c_~#buffer~0.offset| (mod aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 4294967296)) v_ArrVal_831)) (.cse59 (+ .cse57 .cse58 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72)) (.cse62 (+ .cse57 .cse58 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 .cse63))) (or (<= (mod (mod (+ .cse57 .cse58 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 (- 4294967295)) .cse8) 4294967296) 0) (< 2147483647 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72) (<= 8589934591 .cse59) (not (= (select (store .cse60 (+ |c_~#buffer~0.offset| (mod (mod (mod (+ aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 1) 4294967296) .cse8) 4294967296)) v_ArrVal_834) .cse13) .cse12)) (< aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 0) (<= 8589934591 .cse61) (< .cse61 4294967295) (not (= (select .cse60 .cse33) |c_t1Thread1of1ForFork1_~i~0#1|)) (< .cse59 4294967295) (<= 8589934591 .cse62) (< .cse62 4294967295) (<= .cse8 (mod (mod (+ .cse57 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 (- 4294967295)) .cse8) 4294967296)) (<= (mod (mod (mod (+ (mod (+ .cse57 .cse58 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 (- 4294967295) .cse63) .cse8) 1) 4294967296) .cse8) 4294967296) 0))))) .cse1 .cse34) (or (forall ((aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 Int) (aux_div_aux_mod_aux_mod_~next~0_30_35_46 Int) (aux_div_aux_mod_~next~0_30_35 Int) (v_ArrVal_834 Int) (aux_div_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 Int) (v_ArrVal_831 Int)) (let ((.cse70 (* aux_div_aux_mod_~next~0_30_35 4294967296)) (.cse65 (* aux_div_aux_mod_aux_mod_~next~0_30_35_46 4294967296)) (.cse64 (* 4294967296 aux_div_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72))) (let ((.cse68 (+ .cse64 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72)) (.cse66 (store .cse14 (+ |c_~#buffer~0.offset| (mod aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 4294967296) (- 4294967296)) v_ArrVal_831)) (.cse67 (+ .cse64 .cse65 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72)) (.cse69 (+ .cse64 .cse65 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 .cse70))) (or (<= (mod (mod (+ .cse64 .cse65 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 (- 4294967295)) .cse8) 4294967296) 0) (not (= (select (store .cse66 (+ |c_~#buffer~0.offset| (- 4294967296) (mod (mod (mod (+ aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 1) 4294967296) .cse8) 4294967296)) v_ArrVal_834) .cse24) .cse12)) (<= 8589934591 .cse67) (<= 4294967296 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72) (<= 8589934591 .cse68) (< .cse68 4294967295) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse66 .cse11))) (< .cse67 4294967295) (<= 8589934591 .cse69) (< .cse69 4294967295) (<= .cse8 (mod (mod (+ .cse64 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 (- 4294967295)) .cse8) 4294967296)) (<= (mod (mod (mod (+ (mod (+ .cse64 .cse65 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 (- 4294967295) .cse70) .cse8) 1) 4294967296) .cse8) 4294967296) 0) (<= aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 2147483647))))) .cse0 .cse15) (or (and (or (forall ((aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 Int) (aux_div_aux_mod_aux_mod_~next~0_30_35_46 Int) (aux_div_aux_mod_~next~0_30_35 Int) (v_ArrVal_834 Int) (aux_div_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 Int) (v_ArrVal_831 Int)) (let ((.cse77 (* aux_div_aux_mod_~next~0_30_35 4294967296)) (.cse72 (* aux_div_aux_mod_aux_mod_~next~0_30_35_46 4294967296)) (.cse71 (* 4294967296 aux_div_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72))) (let ((.cse74 (+ .cse71 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72)) (.cse73 (+ .cse71 .cse72 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72)) (.cse75 (store .cse14 (+ |c_~#buffer~0.offset| (mod aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 4294967296)) v_ArrVal_831)) (.cse76 (+ .cse71 .cse72 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 .cse77))) (or (<= (mod (mod (+ .cse71 .cse72 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 (- 4294967295)) .cse8) 4294967296) 0) (< 2147483647 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72) (<= 8589934591 .cse73) (< aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 0) (<= 8589934591 .cse74) (< .cse74 4294967295) (not (= (select .cse75 .cse33) |c_t1Thread1of1ForFork1_~i~0#1|)) (< .cse73 4294967295) (not (= (select (store .cse75 (+ |c_~#buffer~0.offset| (- 4294967296) (mod (mod (mod (+ aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 1) 4294967296) .cse8) 4294967296)) v_ArrVal_834) .cse24) .cse12)) (<= 8589934591 .cse76) (< .cse76 4294967295) (<= .cse8 (mod (mod (+ .cse71 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 (- 4294967295)) .cse8) 4294967296)) (<= (mod (mod (mod (+ (mod (+ .cse71 .cse72 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 (- 4294967295) .cse77) .cse8) 1) 4294967296) .cse8) 4294967296) 0))))) .cse34) (or .cse0 (forall ((aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 Int) (aux_div_aux_mod_aux_mod_~next~0_30_35_46 Int) (aux_div_aux_mod_~next~0_30_35 Int) (v_ArrVal_834 Int) (aux_div_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 Int) (v_ArrVal_831 Int)) (let ((.cse84 (* aux_div_aux_mod_~next~0_30_35 4294967296)) (.cse79 (* aux_div_aux_mod_aux_mod_~next~0_30_35_46 4294967296)) (.cse78 (* 4294967296 aux_div_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72))) (let ((.cse82 (+ .cse78 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72)) (.cse80 (+ .cse78 .cse79 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72)) (.cse81 (store .cse14 (+ |c_~#buffer~0.offset| (mod aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 4294967296)) v_ArrVal_831)) (.cse83 (+ .cse78 .cse79 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 .cse84))) (or (<= (mod (mod (+ .cse78 .cse79 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 (- 4294967295)) .cse8) 4294967296) 0) (< 2147483647 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72) (<= 8589934591 .cse80) (< aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 0) (not (= (select .cse81 .cse11) |c_t1Thread1of1ForFork1_~i~0#1|)) (<= 8589934591 .cse82) (< .cse82 4294967295) (< .cse80 4294967295) (not (= (select (store .cse81 (+ |c_~#buffer~0.offset| (- 4294967296) (mod (mod (mod (+ aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 1) 4294967296) .cse8) 4294967296)) v_ArrVal_834) .cse24) .cse12)) (<= 8589934591 .cse83) (< .cse83 4294967295) (<= .cse8 (mod (mod (+ .cse78 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 (- 4294967295)) .cse8) 4294967296)) (<= (mod (mod (mod (+ (mod (+ .cse78 .cse79 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 (- 4294967295) .cse84) .cse8) 1) 4294967296) .cse8) 4294967296) 0))))))) .cse15))) (or (and (or (forall ((aux_div_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 Int) (aux_div_aux_mod_aux_mod_~next~0_30_35_46 Int) (aux_div_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57 Int) (aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 Int) (aux_div_aux_mod_~next~0_30_35 Int) (v_ArrVal_834 Int) (v_ArrVal_831 Int)) (let ((.cse89 (* aux_div_aux_mod_aux_mod_~next~0_30_35_46 4294967296)) (.cse90 (* 4294967296 aux_div_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57)) (.cse93 (* aux_div_aux_mod_~next~0_30_35 4294967296)) (.cse88 (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 4294967296))) (let ((.cse86 (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse88)) (.cse85 (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse88 .cse89 .cse90 .cse93)) (.cse87 (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse88 .cse89 .cse90)) (.cse91 (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse88 .cse90)) (.cse92 (store .cse14 (+ |c_~#buffer~0.offset| (mod aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 4294967296)) v_ArrVal_831))) (or (<= 8589934591 .cse85) (< .cse86 4294967295) (<= 8589934591 .cse87) (<= (mod (mod (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse88 .cse89 .cse90 (- 4294967295)) .cse8) 4294967296) 0) (<= 8589934591 .cse91) (<= .cse8 (mod (mod (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse88 .cse90 (- 4294967295)) .cse8) 4294967296)) (< aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 0) (<= 8589934591 .cse86) (< 0 (mod (mod (mod (+ (mod (mod (+ (mod (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse88 (- 4294967295)) .cse8) 1) 4294967296) .cse8) 1) 4294967296) .cse8) 4294967296)) (not (= (select .cse92 .cse11) |c_t1Thread1of1ForFork1_~i~0#1|)) (< .cse85 4294967295) (< 2147483647 aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83) (< .cse87 4294967295) (<= (mod (mod (mod (+ (mod (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse88 .cse89 .cse90 (- 4294967295) .cse93) .cse8) 1) 4294967296) .cse8) 4294967296) 0) (< .cse91 4294967295) (not (= .cse12 (select (store .cse92 (+ |c_~#buffer~0.offset| (- 4294967296) (mod (mod (mod (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 1) 4294967296) .cse8) 4294967296)) v_ArrVal_834) .cse24))))))) .cse0) (or (forall ((aux_div_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 Int) (aux_div_aux_mod_aux_mod_~next~0_30_35_46 Int) (aux_div_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57 Int) (aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 Int) (aux_div_aux_mod_~next~0_30_35 Int) (v_ArrVal_834 Int) (v_ArrVal_831 Int)) (let ((.cse98 (* aux_div_aux_mod_aux_mod_~next~0_30_35_46 4294967296)) (.cse99 (* 4294967296 aux_div_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57)) (.cse97 (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 4294967296))) (let ((.cse95 (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse97)) (.cse94 (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse97 .cse98 .cse99 (* aux_div_aux_mod_~next~0_30_35 4294967296))) (.cse96 (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse97 .cse98 .cse99)) (.cse100 (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse97 .cse99)) (.cse101 (store .cse14 (+ |c_~#buffer~0.offset| (mod aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 4294967296)) v_ArrVal_831))) (or (<= 8589934591 .cse94) (< .cse95 4294967295) (<= 8589934591 .cse96) (<= (mod (mod (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse97 .cse98 .cse99 (- 4294967295)) .cse8) 4294967296) 0) (<= 8589934591 .cse100) (<= .cse8 (mod (mod (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse97 .cse99 (- 4294967295)) .cse8) 4294967296)) (< aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 0) (<= 8589934591 .cse95) (< 0 (mod (mod (mod (+ (mod (mod (+ (mod (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse97 (- 4294967295)) .cse8) 1) 4294967296) .cse8) 1) 4294967296) .cse8) 4294967296)) (< .cse94 4294967295) (< 2147483647 aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83) (< .cse96 4294967295) (< .cse100 4294967295) (not (= .cse12 (select (store .cse101 (+ |c_~#buffer~0.offset| (- 4294967296) (mod (mod (mod (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 1) 4294967296) .cse8) 4294967296)) v_ArrVal_834) .cse24))) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse101 .cse33))))))) .cse34)) .cse15) (or (and (or (forall ((aux_div_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 Int) (aux_div_aux_mod_aux_mod_~next~0_30_35_46 Int) (aux_div_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57 Int) (aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 Int) (aux_div_aux_mod_~next~0_30_35 Int) (v_ArrVal_834 Int) (v_ArrVal_831 Int)) (let ((.cse106 (* aux_div_aux_mod_aux_mod_~next~0_30_35_46 4294967296)) (.cse107 (* 4294967296 aux_div_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57)) (.cse105 (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 4294967296))) (let ((.cse103 (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse105)) (.cse109 (store .cse14 (+ |c_~#buffer~0.offset| (- 4294967296) (mod aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 4294967296)) v_ArrVal_831)) (.cse102 (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse105 .cse106 .cse107 (* aux_div_aux_mod_~next~0_30_35 4294967296))) (.cse104 (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse105 .cse106 .cse107)) (.cse108 (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse105 .cse107))) (or (<= 8589934591 .cse102) (< .cse103 4294967295) (<= 8589934591 .cse104) (<= (mod (mod (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse105 .cse106 .cse107 (- 4294967295)) .cse8) 4294967296) 0) (<= 8589934591 .cse108) (<= .cse8 (mod (mod (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse105 .cse107 (- 4294967295)) .cse8) 4294967296)) (not (= (select .cse109 .cse33) |c_t1Thread1of1ForFork1_~i~0#1|)) (<= 8589934591 .cse103) (< 0 (mod (mod (mod (+ (mod (mod (+ (mod (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse105 (- 4294967295)) .cse8) 1) 4294967296) .cse8) 1) 4294967296) .cse8) 4294967296)) (not (= (select (store .cse109 (+ |c_~#buffer~0.offset| (- 4294967296) (mod (mod (mod (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 1) 4294967296) .cse8) 4294967296)) v_ArrVal_834) .cse24) .cse12)) (< .cse102 4294967295) (< .cse104 4294967295) (< .cse108 4294967295) (<= aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 2147483647) (<= 4294967296 aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83))))) .cse15) (or .cse1 (forall ((aux_div_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 Int) (aux_div_aux_mod_aux_mod_~next~0_30_35_46 Int) (aux_div_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57 Int) (aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 Int) (aux_div_aux_mod_~next~0_30_35 Int) (v_ArrVal_834 Int) (v_ArrVal_831 Int)) (let ((.cse114 (* aux_div_aux_mod_aux_mod_~next~0_30_35_46 4294967296)) (.cse115 (* 4294967296 aux_div_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57)) (.cse113 (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 4294967296))) (let ((.cse117 (store .cse14 (+ |c_~#buffer~0.offset| (- 4294967296) (mod aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 4294967296)) v_ArrVal_831)) (.cse111 (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse113)) (.cse110 (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse113 .cse114 .cse115 (* aux_div_aux_mod_~next~0_30_35 4294967296))) (.cse112 (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse113 .cse114 .cse115)) (.cse116 (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse113 .cse115))) (or (<= 8589934591 .cse110) (< .cse111 4294967295) (<= 8589934591 .cse112) (<= (mod (mod (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse113 .cse114 .cse115 (- 4294967295)) .cse8) 4294967296) 0) (<= 8589934591 .cse116) (<= .cse8 (mod (mod (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse113 .cse115 (- 4294967295)) .cse8) 4294967296)) (not (= (select .cse117 .cse33) |c_t1Thread1of1ForFork1_~i~0#1|)) (not (= .cse12 (select (store .cse117 (+ |c_~#buffer~0.offset| (mod (mod (mod (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 1) 4294967296) .cse8) 4294967296)) v_ArrVal_834) .cse13))) (<= 8589934591 .cse111) (< 0 (mod (mod (mod (+ (mod (mod (+ (mod (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse113 (- 4294967295)) .cse8) 1) 4294967296) .cse8) 1) 4294967296) .cse8) 4294967296)) (< .cse110 4294967295) (< .cse112 4294967295) (< .cse116 4294967295) (<= aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 2147483647) (<= 4294967296 aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83))))))) .cse34))))) is different from true [2022-12-13 00:14:34,930 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse117 (mod (+ c_~first~0 1) 4294967296)) (.cse118 (mod c_~first~0 4294967296))) (let ((.cse0 (<= .cse118 2147483647)) (.cse15 (<= .cse117 2147483647))) (let ((.cse11 (+ |c_~#buffer~0.offset| .cse118 (- 4294967296))) (.cse24 (+ |c_~#buffer~0.offset| .cse117 (- 4294967296))) (.cse1 (not .cse15)) (.cse33 (+ |c_~#buffer~0.offset| .cse118)) (.cse12 (+ |c_t1Thread1of1ForFork1_~i~0#1| 1)) (.cse13 (+ |c_~#buffer~0.offset| .cse117)) (.cse8 (mod c_~buffer_size~0 4294967296)) (.cse14 (select |c_#memory_int| |c_~#buffer~0.base|)) (.cse34 (not .cse0))) (and (or .cse0 (and (or .cse1 (forall ((aux_div_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 Int) (aux_div_aux_mod_aux_mod_~next~0_30_35_46 Int) (aux_div_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57 Int) (aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 Int) (aux_div_aux_mod_~next~0_30_35 Int) (v_ArrVal_834 Int) (v_ArrVal_831 Int)) (let ((.cse6 (* aux_div_aux_mod_aux_mod_~next~0_30_35_46 4294967296)) (.cse7 (* 4294967296 aux_div_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57)) (.cse5 (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 4294967296))) (let ((.cse10 (store .cse14 (+ |c_~#buffer~0.offset| (- 4294967296) (mod aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 4294967296)) v_ArrVal_831)) (.cse3 (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse5)) (.cse2 (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse5 .cse6 .cse7 (* aux_div_aux_mod_~next~0_30_35 4294967296))) (.cse4 (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse5 .cse6 .cse7)) (.cse9 (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse5 .cse7))) (or (<= 8589934591 .cse2) (< .cse3 4294967295) (<= 8589934591 .cse4) (<= (mod (mod (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse5 .cse6 .cse7 (- 4294967295)) .cse8) 4294967296) 0) (<= 8589934591 .cse9) (<= .cse8 (mod (mod (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse5 .cse7 (- 4294967295)) .cse8) 4294967296)) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse10 .cse11))) (not (= .cse12 (select (store .cse10 (+ |c_~#buffer~0.offset| (mod (mod (mod (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 1) 4294967296) .cse8) 4294967296)) v_ArrVal_834) .cse13))) (<= 8589934591 .cse3) (< 0 (mod (mod (mod (+ (mod (mod (+ (mod (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse5 (- 4294967295)) .cse8) 1) 4294967296) .cse8) 1) 4294967296) .cse8) 4294967296)) (< .cse2 4294967295) (< .cse4 4294967295) (< .cse9 4294967295) (<= aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 2147483647) (<= 4294967296 aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83)))))) (or .cse15 (forall ((aux_div_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 Int) (aux_div_aux_mod_aux_mod_~next~0_30_35_46 Int) (aux_div_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57 Int) (aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 Int) (aux_div_aux_mod_~next~0_30_35 Int) (v_ArrVal_834 Int) (v_ArrVal_831 Int)) (let ((.cse20 (* aux_div_aux_mod_aux_mod_~next~0_30_35_46 4294967296)) (.cse21 (* 4294967296 aux_div_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57)) (.cse19 (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 4294967296))) (let ((.cse17 (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse19)) (.cse23 (store .cse14 (+ |c_~#buffer~0.offset| (- 4294967296) (mod aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 4294967296)) v_ArrVal_831)) (.cse16 (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse19 .cse20 .cse21 (* aux_div_aux_mod_~next~0_30_35 4294967296))) (.cse18 (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse19 .cse20 .cse21)) (.cse22 (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse19 .cse21))) (or (<= 8589934591 .cse16) (< .cse17 4294967295) (<= 8589934591 .cse18) (<= (mod (mod (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse19 .cse20 .cse21 (- 4294967295)) .cse8) 4294967296) 0) (<= 8589934591 .cse22) (<= .cse8 (mod (mod (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse19 .cse21 (- 4294967295)) .cse8) 4294967296)) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse23 .cse11))) (<= 8589934591 .cse17) (< 0 (mod (mod (mod (+ (mod (mod (+ (mod (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse19 (- 4294967295)) .cse8) 1) 4294967296) .cse8) 1) 4294967296) .cse8) 4294967296)) (not (= (select (store .cse23 (+ |c_~#buffer~0.offset| (- 4294967296) (mod (mod (mod (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 1) 4294967296) .cse8) 4294967296)) v_ArrVal_834) .cse24) .cse12)) (< .cse16 4294967295) (< .cse18 4294967295) (< .cse22 4294967295) (<= aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 2147483647) (<= 4294967296 aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83)))))))) (or (and (or (forall ((aux_div_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 Int) (aux_div_aux_mod_aux_mod_~next~0_30_35_46 Int) (aux_div_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57 Int) (aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 Int) (aux_div_aux_mod_~next~0_30_35 Int) (v_ArrVal_834 Int) (v_ArrVal_831 Int)) (let ((.cse30 (* aux_div_aux_mod_aux_mod_~next~0_30_35_46 4294967296)) (.cse31 (* 4294967296 aux_div_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57)) (.cse29 (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 4294967296))) (let ((.cse27 (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse29)) (.cse26 (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse29 .cse30 .cse31 (* aux_div_aux_mod_~next~0_30_35 4294967296))) (.cse28 (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse29 .cse30 .cse31)) (.cse32 (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse29 .cse31)) (.cse25 (store .cse14 (+ |c_~#buffer~0.offset| (mod aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 4294967296)) v_ArrVal_831))) (or (not (= (select (store .cse25 (+ |c_~#buffer~0.offset| (mod (mod (mod (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 1) 4294967296) .cse8) 4294967296)) v_ArrVal_834) .cse13) .cse12)) (<= 8589934591 .cse26) (< .cse27 4294967295) (<= 8589934591 .cse28) (<= (mod (mod (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse29 .cse30 .cse31 (- 4294967295)) .cse8) 4294967296) 0) (<= 8589934591 .cse32) (<= .cse8 (mod (mod (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse29 .cse31 (- 4294967295)) .cse8) 4294967296)) (< aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 0) (<= 8589934591 .cse27) (< 0 (mod (mod (mod (+ (mod (mod (+ (mod (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse29 (- 4294967295)) .cse8) 1) 4294967296) .cse8) 1) 4294967296) .cse8) 4294967296)) (< .cse26 4294967295) (< 2147483647 aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83) (< .cse28 4294967295) (< .cse32 4294967295) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse25 .cse33))))))) .cse34) (or .cse0 (forall ((aux_div_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 Int) (aux_div_aux_mod_aux_mod_~next~0_30_35_46 Int) (aux_div_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57 Int) (aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 Int) (aux_div_aux_mod_~next~0_30_35 Int) (v_ArrVal_834 Int) (v_ArrVal_831 Int)) (let ((.cse40 (* aux_div_aux_mod_aux_mod_~next~0_30_35_46 4294967296)) (.cse41 (* 4294967296 aux_div_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57)) (.cse39 (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 4294967296))) (let ((.cse37 (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse39)) (.cse35 (store .cse14 (+ |c_~#buffer~0.offset| (mod aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 4294967296)) v_ArrVal_831)) (.cse36 (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse39 .cse40 .cse41 (* aux_div_aux_mod_~next~0_30_35 4294967296))) (.cse38 (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse39 .cse40 .cse41)) (.cse42 (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse39 .cse41))) (or (not (= (select (store .cse35 (+ |c_~#buffer~0.offset| (mod (mod (mod (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 1) 4294967296) .cse8) 4294967296)) v_ArrVal_834) .cse13) .cse12)) (<= 8589934591 .cse36) (< .cse37 4294967295) (<= 8589934591 .cse38) (<= (mod (mod (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse39 .cse40 .cse41 (- 4294967295)) .cse8) 4294967296) 0) (<= 8589934591 .cse42) (<= .cse8 (mod (mod (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse39 .cse41 (- 4294967295)) .cse8) 4294967296)) (< aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 0) (<= 8589934591 .cse37) (< 0 (mod (mod (mod (+ (mod (mod (+ (mod (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse39 (- 4294967295)) .cse8) 1) 4294967296) .cse8) 1) 4294967296) .cse8) 4294967296)) (not (= (select .cse35 .cse11) |c_t1Thread1of1ForFork1_~i~0#1|)) (< .cse36 4294967295) (< 2147483647 aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83) (< .cse38 4294967295) (< .cse42 4294967295))))))) .cse1) (or (< (mod (+ 2 c_~first~0) 4294967296) .cse8) (and (or (and (or .cse15 (forall ((aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 Int) (aux_div_aux_mod_aux_mod_~next~0_30_35_46 Int) (aux_div_aux_mod_~next~0_30_35 Int) (v_ArrVal_834 Int) (aux_div_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 Int) (v_ArrVal_831 Int)) (let ((.cse49 (* aux_div_aux_mod_~next~0_30_35 4294967296)) (.cse45 (* aux_div_aux_mod_aux_mod_~next~0_30_35_46 4294967296)) (.cse44 (* 4294967296 aux_div_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72))) (let ((.cse43 (store .cse14 (+ |c_~#buffer~0.offset| (mod aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 4294967296) (- 4294967296)) v_ArrVal_831)) (.cse47 (+ .cse44 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72)) (.cse46 (+ .cse44 .cse45 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72)) (.cse48 (+ .cse44 .cse45 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 .cse49))) (or (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse43 .cse33))) (<= (mod (mod (+ .cse44 .cse45 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 (- 4294967295)) .cse8) 4294967296) 0) (not (= (select (store .cse43 (+ |c_~#buffer~0.offset| (- 4294967296) (mod (mod (mod (+ aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 1) 4294967296) .cse8) 4294967296)) v_ArrVal_834) .cse24) .cse12)) (<= 8589934591 .cse46) (<= 4294967296 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72) (<= 8589934591 .cse47) (< .cse47 4294967295) (< .cse46 4294967295) (<= 8589934591 .cse48) (< .cse48 4294967295) (<= .cse8 (mod (mod (+ .cse44 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 (- 4294967295)) .cse8) 4294967296)) (<= (mod (mod (mod (+ (mod (+ .cse44 .cse45 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 (- 4294967295) .cse49) .cse8) 1) 4294967296) .cse8) 4294967296) 0) (<= aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 2147483647)))))) (or .cse1 (forall ((aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 Int) (aux_div_aux_mod_aux_mod_~next~0_30_35_46 Int) (aux_div_aux_mod_~next~0_30_35 Int) (v_ArrVal_834 Int) (aux_div_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 Int) (v_ArrVal_831 Int)) (let ((.cse56 (* aux_div_aux_mod_~next~0_30_35 4294967296)) (.cse52 (* aux_div_aux_mod_aux_mod_~next~0_30_35_46 4294967296)) (.cse51 (* 4294967296 aux_div_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72))) (let ((.cse54 (+ .cse51 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72)) (.cse53 (+ .cse51 .cse52 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72)) (.cse55 (+ .cse51 .cse52 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 .cse56)) (.cse50 (store .cse14 (+ |c_~#buffer~0.offset| (mod aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 4294967296) (- 4294967296)) v_ArrVal_831))) (or (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse50 .cse33))) (<= (mod (mod (+ .cse51 .cse52 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 (- 4294967295)) .cse8) 4294967296) 0) (<= 8589934591 .cse53) (<= 4294967296 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72) (<= 8589934591 .cse54) (< .cse54 4294967295) (< .cse53 4294967295) (<= 8589934591 .cse55) (< .cse55 4294967295) (not (= (select (store .cse50 (+ |c_~#buffer~0.offset| (mod (mod (mod (+ aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 1) 4294967296) .cse8) 4294967296)) v_ArrVal_834) .cse13) .cse12)) (<= .cse8 (mod (mod (+ .cse51 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 (- 4294967295)) .cse8) 4294967296)) (<= (mod (mod (mod (+ (mod (+ .cse51 .cse52 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 (- 4294967295) .cse56) .cse8) 1) 4294967296) .cse8) 4294967296) 0) (<= aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 2147483647))))))) .cse34) (or (forall ((aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 Int) (aux_div_aux_mod_aux_mod_~next~0_30_35_46 Int) (aux_div_aux_mod_~next~0_30_35 Int) (v_ArrVal_834 Int) (aux_div_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 Int) (v_ArrVal_831 Int)) (let ((.cse63 (* aux_div_aux_mod_~next~0_30_35 4294967296)) (.cse58 (* aux_div_aux_mod_aux_mod_~next~0_30_35_46 4294967296)) (.cse57 (* 4294967296 aux_div_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72))) (let ((.cse61 (+ .cse57 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72)) (.cse60 (store .cse14 (+ |c_~#buffer~0.offset| (mod aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 4294967296)) v_ArrVal_831)) (.cse59 (+ .cse57 .cse58 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72)) (.cse62 (+ .cse57 .cse58 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 .cse63))) (or (<= (mod (mod (+ .cse57 .cse58 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 (- 4294967295)) .cse8) 4294967296) 0) (< 2147483647 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72) (<= 8589934591 .cse59) (not (= (select (store .cse60 (+ |c_~#buffer~0.offset| (mod (mod (mod (+ aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 1) 4294967296) .cse8) 4294967296)) v_ArrVal_834) .cse13) .cse12)) (< aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 0) (<= 8589934591 .cse61) (< .cse61 4294967295) (not (= (select .cse60 .cse33) |c_t1Thread1of1ForFork1_~i~0#1|)) (< .cse59 4294967295) (<= 8589934591 .cse62) (< .cse62 4294967295) (<= .cse8 (mod (mod (+ .cse57 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 (- 4294967295)) .cse8) 4294967296)) (<= (mod (mod (mod (+ (mod (+ .cse57 .cse58 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 (- 4294967295) .cse63) .cse8) 1) 4294967296) .cse8) 4294967296) 0))))) .cse1 .cse34) (or (forall ((aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 Int) (aux_div_aux_mod_aux_mod_~next~0_30_35_46 Int) (aux_div_aux_mod_~next~0_30_35 Int) (v_ArrVal_834 Int) (aux_div_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 Int) (v_ArrVal_831 Int)) (let ((.cse70 (* aux_div_aux_mod_~next~0_30_35 4294967296)) (.cse65 (* aux_div_aux_mod_aux_mod_~next~0_30_35_46 4294967296)) (.cse64 (* 4294967296 aux_div_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72))) (let ((.cse68 (+ .cse64 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72)) (.cse66 (store .cse14 (+ |c_~#buffer~0.offset| (mod aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 4294967296) (- 4294967296)) v_ArrVal_831)) (.cse67 (+ .cse64 .cse65 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72)) (.cse69 (+ .cse64 .cse65 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 .cse70))) (or (<= (mod (mod (+ .cse64 .cse65 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 (- 4294967295)) .cse8) 4294967296) 0) (not (= (select (store .cse66 (+ |c_~#buffer~0.offset| (- 4294967296) (mod (mod (mod (+ aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 1) 4294967296) .cse8) 4294967296)) v_ArrVal_834) .cse24) .cse12)) (<= 8589934591 .cse67) (<= 4294967296 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72) (<= 8589934591 .cse68) (< .cse68 4294967295) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse66 .cse11))) (< .cse67 4294967295) (<= 8589934591 .cse69) (< .cse69 4294967295) (<= .cse8 (mod (mod (+ .cse64 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 (- 4294967295)) .cse8) 4294967296)) (<= (mod (mod (mod (+ (mod (+ .cse64 .cse65 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 (- 4294967295) .cse70) .cse8) 1) 4294967296) .cse8) 4294967296) 0) (<= aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 2147483647))))) .cse0 .cse15) (or (and (or (forall ((aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 Int) (aux_div_aux_mod_aux_mod_~next~0_30_35_46 Int) (aux_div_aux_mod_~next~0_30_35 Int) (v_ArrVal_834 Int) (aux_div_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 Int) (v_ArrVal_831 Int)) (let ((.cse77 (* aux_div_aux_mod_~next~0_30_35 4294967296)) (.cse72 (* aux_div_aux_mod_aux_mod_~next~0_30_35_46 4294967296)) (.cse71 (* 4294967296 aux_div_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72))) (let ((.cse74 (+ .cse71 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72)) (.cse73 (+ .cse71 .cse72 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72)) (.cse75 (store .cse14 (+ |c_~#buffer~0.offset| (mod aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 4294967296)) v_ArrVal_831)) (.cse76 (+ .cse71 .cse72 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 .cse77))) (or (<= (mod (mod (+ .cse71 .cse72 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 (- 4294967295)) .cse8) 4294967296) 0) (< 2147483647 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72) (<= 8589934591 .cse73) (< aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 0) (<= 8589934591 .cse74) (< .cse74 4294967295) (not (= (select .cse75 .cse33) |c_t1Thread1of1ForFork1_~i~0#1|)) (< .cse73 4294967295) (not (= (select (store .cse75 (+ |c_~#buffer~0.offset| (- 4294967296) (mod (mod (mod (+ aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 1) 4294967296) .cse8) 4294967296)) v_ArrVal_834) .cse24) .cse12)) (<= 8589934591 .cse76) (< .cse76 4294967295) (<= .cse8 (mod (mod (+ .cse71 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 (- 4294967295)) .cse8) 4294967296)) (<= (mod (mod (mod (+ (mod (+ .cse71 .cse72 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 (- 4294967295) .cse77) .cse8) 1) 4294967296) .cse8) 4294967296) 0))))) .cse34) (or .cse0 (forall ((aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 Int) (aux_div_aux_mod_aux_mod_~next~0_30_35_46 Int) (aux_div_aux_mod_~next~0_30_35 Int) (v_ArrVal_834 Int) (aux_div_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 Int) (v_ArrVal_831 Int)) (let ((.cse84 (* aux_div_aux_mod_~next~0_30_35 4294967296)) (.cse79 (* aux_div_aux_mod_aux_mod_~next~0_30_35_46 4294967296)) (.cse78 (* 4294967296 aux_div_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72))) (let ((.cse82 (+ .cse78 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72)) (.cse80 (+ .cse78 .cse79 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72)) (.cse81 (store .cse14 (+ |c_~#buffer~0.offset| (mod aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 4294967296)) v_ArrVal_831)) (.cse83 (+ .cse78 .cse79 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 .cse84))) (or (<= (mod (mod (+ .cse78 .cse79 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 (- 4294967295)) .cse8) 4294967296) 0) (< 2147483647 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72) (<= 8589934591 .cse80) (< aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 0) (not (= (select .cse81 .cse11) |c_t1Thread1of1ForFork1_~i~0#1|)) (<= 8589934591 .cse82) (< .cse82 4294967295) (< .cse80 4294967295) (not (= (select (store .cse81 (+ |c_~#buffer~0.offset| (- 4294967296) (mod (mod (mod (+ aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 1) 4294967296) .cse8) 4294967296)) v_ArrVal_834) .cse24) .cse12)) (<= 8589934591 .cse83) (< .cse83 4294967295) (<= .cse8 (mod (mod (+ .cse78 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 (- 4294967295)) .cse8) 4294967296)) (<= (mod (mod (mod (+ (mod (+ .cse78 .cse79 aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_72 (- 4294967295) .cse84) .cse8) 1) 4294967296) .cse8) 4294967296) 0))))))) .cse15))) (or (and (or (forall ((aux_div_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 Int) (aux_div_aux_mod_aux_mod_~next~0_30_35_46 Int) (aux_div_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57 Int) (aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 Int) (aux_div_aux_mod_~next~0_30_35 Int) (v_ArrVal_834 Int) (v_ArrVal_831 Int)) (let ((.cse89 (* aux_div_aux_mod_aux_mod_~next~0_30_35_46 4294967296)) (.cse90 (* 4294967296 aux_div_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57)) (.cse88 (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 4294967296))) (let ((.cse86 (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse88)) (.cse85 (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse88 .cse89 .cse90 (* aux_div_aux_mod_~next~0_30_35 4294967296))) (.cse87 (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse88 .cse89 .cse90)) (.cse91 (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse88 .cse90)) (.cse92 (store .cse14 (+ |c_~#buffer~0.offset| (mod aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 4294967296)) v_ArrVal_831))) (or (<= 8589934591 .cse85) (< .cse86 4294967295) (<= 8589934591 .cse87) (<= (mod (mod (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse88 .cse89 .cse90 (- 4294967295)) .cse8) 4294967296) 0) (<= 8589934591 .cse91) (<= .cse8 (mod (mod (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse88 .cse90 (- 4294967295)) .cse8) 4294967296)) (< aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 0) (<= 8589934591 .cse86) (< 0 (mod (mod (mod (+ (mod (mod (+ (mod (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse88 (- 4294967295)) .cse8) 1) 4294967296) .cse8) 1) 4294967296) .cse8) 4294967296)) (< .cse85 4294967295) (< 2147483647 aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83) (< .cse87 4294967295) (< .cse91 4294967295) (not (= .cse12 (select (store .cse92 (+ |c_~#buffer~0.offset| (- 4294967296) (mod (mod (mod (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 1) 4294967296) .cse8) 4294967296)) v_ArrVal_834) .cse24))) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse92 .cse33))))))) .cse34) (or (forall ((aux_div_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 Int) (aux_div_aux_mod_aux_mod_~next~0_30_35_46 Int) (aux_div_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57 Int) (aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 Int) (aux_div_aux_mod_~next~0_30_35 Int) (v_ArrVal_834 Int) (v_ArrVal_831 Int)) (let ((.cse97 (* aux_div_aux_mod_aux_mod_~next~0_30_35_46 4294967296)) (.cse98 (* 4294967296 aux_div_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57)) (.cse96 (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 4294967296))) (let ((.cse94 (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse96)) (.cse93 (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse96 .cse97 .cse98 (* aux_div_aux_mod_~next~0_30_35 4294967296))) (.cse95 (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse96 .cse97 .cse98)) (.cse99 (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse96 .cse98)) (.cse100 (store .cse14 (+ |c_~#buffer~0.offset| (mod aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 4294967296)) v_ArrVal_831))) (or (<= 8589934591 .cse93) (< .cse94 4294967295) (<= 8589934591 .cse95) (<= (mod (mod (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse96 .cse97 .cse98 (- 4294967295)) .cse8) 4294967296) 0) (<= 8589934591 .cse99) (<= .cse8 (mod (mod (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse96 .cse98 (- 4294967295)) .cse8) 4294967296)) (< aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 0) (<= 8589934591 .cse94) (< 0 (mod (mod (mod (+ (mod (mod (+ (mod (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse96 (- 4294967295)) .cse8) 1) 4294967296) .cse8) 1) 4294967296) .cse8) 4294967296)) (not (= (select .cse100 .cse11) |c_t1Thread1of1ForFork1_~i~0#1|)) (< .cse93 4294967295) (< 2147483647 aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83) (< .cse95 4294967295) (< .cse99 4294967295) (not (= .cse12 (select (store .cse100 (+ |c_~#buffer~0.offset| (- 4294967296) (mod (mod (mod (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 1) 4294967296) .cse8) 4294967296)) v_ArrVal_834) .cse24))))))) .cse0)) .cse15) (or (and (or (forall ((aux_div_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 Int) (aux_div_aux_mod_aux_mod_~next~0_30_35_46 Int) (aux_div_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57 Int) (aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 Int) (aux_div_aux_mod_~next~0_30_35 Int) (v_ArrVal_834 Int) (v_ArrVal_831 Int)) (let ((.cse105 (* aux_div_aux_mod_aux_mod_~next~0_30_35_46 4294967296)) (.cse106 (* 4294967296 aux_div_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57)) (.cse104 (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 4294967296))) (let ((.cse102 (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse104)) (.cse108 (store .cse14 (+ |c_~#buffer~0.offset| (- 4294967296) (mod aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 4294967296)) v_ArrVal_831)) (.cse101 (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse104 .cse105 .cse106 (* aux_div_aux_mod_~next~0_30_35 4294967296))) (.cse103 (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse104 .cse105 .cse106)) (.cse107 (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse104 .cse106))) (or (<= 8589934591 .cse101) (< .cse102 4294967295) (<= 8589934591 .cse103) (<= (mod (mod (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse104 .cse105 .cse106 (- 4294967295)) .cse8) 4294967296) 0) (<= 8589934591 .cse107) (<= .cse8 (mod (mod (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse104 .cse106 (- 4294967295)) .cse8) 4294967296)) (not (= (select .cse108 .cse33) |c_t1Thread1of1ForFork1_~i~0#1|)) (<= 8589934591 .cse102) (< 0 (mod (mod (mod (+ (mod (mod (+ (mod (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse104 (- 4294967295)) .cse8) 1) 4294967296) .cse8) 1) 4294967296) .cse8) 4294967296)) (not (= (select (store .cse108 (+ |c_~#buffer~0.offset| (- 4294967296) (mod (mod (mod (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 1) 4294967296) .cse8) 4294967296)) v_ArrVal_834) .cse24) .cse12)) (< .cse101 4294967295) (< .cse103 4294967295) (< .cse107 4294967295) (<= aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 2147483647) (<= 4294967296 aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83))))) .cse15) (or .cse1 (forall ((aux_div_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 Int) (aux_div_aux_mod_aux_mod_~next~0_30_35_46 Int) (aux_div_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57 Int) (aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 Int) (aux_div_aux_mod_~next~0_30_35 Int) (v_ArrVal_834 Int) (v_ArrVal_831 Int)) (let ((.cse113 (* aux_div_aux_mod_aux_mod_~next~0_30_35_46 4294967296)) (.cse114 (* 4294967296 aux_div_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57)) (.cse112 (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 4294967296))) (let ((.cse116 (store .cse14 (+ |c_~#buffer~0.offset| (- 4294967296) (mod aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 4294967296)) v_ArrVal_831)) (.cse110 (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse112)) (.cse109 (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse112 .cse113 .cse114 (* aux_div_aux_mod_~next~0_30_35 4294967296))) (.cse111 (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse112 .cse113 .cse114)) (.cse115 (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse112 .cse114))) (or (<= 8589934591 .cse109) (< .cse110 4294967295) (<= 8589934591 .cse111) (<= (mod (mod (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse112 .cse113 .cse114 (- 4294967295)) .cse8) 4294967296) 0) (<= 8589934591 .cse115) (<= .cse8 (mod (mod (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse112 .cse114 (- 4294967295)) .cse8) 4294967296)) (not (= (select .cse116 .cse33) |c_t1Thread1of1ForFork1_~i~0#1|)) (not (= .cse12 (select (store .cse116 (+ |c_~#buffer~0.offset| (mod (mod (mod (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 1) 4294967296) .cse8) 4294967296)) v_ArrVal_834) .cse13))) (<= 8589934591 .cse110) (< 0 (mod (mod (mod (+ (mod (mod (+ (mod (+ aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 .cse112 (- 4294967295)) .cse8) 1) 4294967296) .cse8) 1) 4294967296) .cse8) 4294967296)) (< .cse109 4294967295) (< .cse111 4294967295) (< .cse115 4294967295) (<= aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83 2147483647) (<= 4294967296 aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_~next~0_30_35_46_57_83))))))) .cse34))))) is different from true Received shutdown request... [2022-12-13 00:17:02,798 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 00:17:02,798 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 00:17:03,245 WARN L249 SmtUtils]: Removed 2 from assertion stack [2022-12-13 00:17:03,247 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2022-12-13 00:17:03,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-13 00:17:03,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 00:17:03,448 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 73 with TraceHistMax 5,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 2ms.. [2022-12-13 00:17:03,450 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 8 remaining) [2022-12-13 00:17:03,450 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 8 remaining) [2022-12-13 00:17:03,450 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2022-12-13 00:17:03,450 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err1ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2022-12-13 00:17:03,450 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2022-12-13 00:17:03,450 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 8 remaining) [2022-12-13 00:17:03,450 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err1ASSERT_VIOLATIONERROR_FUNCTION (0 of 8 remaining) [2022-12-13 00:17:03,451 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:17:03,454 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 00:17:03,454 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 00:17:03,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:17:03 BasicIcfg [2022-12-13 00:17:03,456 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 00:17:03,457 INFO L158 Benchmark]: Toolchain (without parser) took 871541.13ms. Allocated memory was 186.6MB in the beginning and 887.1MB in the end (delta: 700.4MB). Free memory was 161.5MB in the beginning and 566.4MB in the end (delta: -404.9MB). Peak memory consumption was 745.4MB. Max. memory is 8.0GB. [2022-12-13 00:17:03,457 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 186.6MB. Free memory is still 162.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 00:17:03,460 INFO L158 Benchmark]: CACSL2BoogieTranslator took 461.20ms. Allocated memory is still 186.6MB. Free memory was 161.0MB in the beginning and 140.6MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-12-13 00:17:03,460 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.64ms. Allocated memory is still 186.6MB. Free memory was 140.6MB in the beginning and 138.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 00:17:03,460 INFO L158 Benchmark]: Boogie Preprocessor took 25.65ms. Allocated memory is still 186.6MB. Free memory was 138.5MB in the beginning and 136.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 00:17:03,460 INFO L158 Benchmark]: RCFGBuilder took 521.15ms. Allocated memory is still 186.6MB. Free memory was 136.4MB in the beginning and 118.0MB in the end (delta: 18.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2022-12-13 00:17:03,460 INFO L158 Benchmark]: TraceAbstraction took 870489.47ms. Allocated memory was 186.6MB in the beginning and 887.1MB in the end (delta: 700.4MB). Free memory was 117.0MB in the beginning and 566.4MB in the end (delta: -449.5MB). Peak memory consumption was 701.3MB. Max. memory is 8.0GB. [2022-12-13 00:17:03,463 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 186.6MB. Free memory is still 162.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 461.20ms. Allocated memory is still 186.6MB. Free memory was 161.0MB in the beginning and 140.6MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.64ms. Allocated memory is still 186.6MB. Free memory was 140.6MB in the beginning and 138.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.65ms. Allocated memory is still 186.6MB. Free memory was 138.5MB in the beginning and 136.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 521.15ms. Allocated memory is still 186.6MB. Free memory was 136.4MB in the beginning and 118.0MB in the end (delta: 18.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 870489.47ms. Allocated memory was 186.6MB in the beginning and 887.1MB in the end (delta: 700.4MB). Free memory was 117.0MB in the beginning and 566.4MB in the end (delta: -449.5MB). Peak memory consumption was 701.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.4s, 133 PlacesBefore, 95 PlacesAfterwards, 137 TransitionsBefore, 99 TransitionsAfterwards, 4498 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 9 ConcurrentSequentialCompositions, 42 TrivialYvCompositions, 58 ConcurrentYvCompositions, 4 ChoiceCompositions, 113 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10734, independent: 10520, independent conditional: 10520, independent unconditional: 0, dependent: 202, dependent conditional: 202, dependent unconditional: 0, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10734, independent: 10520, independent conditional: 0, independent unconditional: 10520, dependent: 202, dependent conditional: 0, dependent unconditional: 202, unknown: 12, unknown conditional: 0, unknown unconditional: 12] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10734, independent: 10520, independent conditional: 0, independent unconditional: 10520, dependent: 202, dependent conditional: 0, dependent unconditional: 202, unknown: 12, unknown conditional: 0, unknown unconditional: 12] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10734, independent: 10520, independent conditional: 0, independent unconditional: 10520, dependent: 202, dependent conditional: 0, dependent unconditional: 202, unknown: 12, unknown conditional: 0, unknown unconditional: 12] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4515, independent: 4458, independent conditional: 0, independent unconditional: 4458, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4515, independent: 4330, independent conditional: 0, independent unconditional: 4330, dependent: 185, dependent conditional: 0, dependent unconditional: 185, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 185, independent: 128, independent conditional: 0, independent unconditional: 128, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2531, independent: 219, independent conditional: 0, independent unconditional: 219, dependent: 140, dependent conditional: 0, dependent unconditional: 140, unknown: 2171, unknown conditional: 0, unknown unconditional: 2171] ], Cache Queries: [ total: 10734, independent: 6062, independent conditional: 0, independent unconditional: 6062, dependent: 146, dependent conditional: 0, dependent unconditional: 146, unknown: 4526, unknown conditional: 0, unknown unconditional: 4526] , Statistics on independence cache: Total cache size (in pairs): 11232, Positive cache size: 11176, Positive conditional cache size: 0, Positive unconditional cache size: 11176, Negative cache size: 56, Negative conditional cache size: 0, Negative unconditional cache size: 56, Unknown cache size: 1, Unknown conditional cache size: 0, Unknown unconditional cache size: 1, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 749]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 73 with TraceHistMax 5,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 2ms.. - TimeoutResultAtElement [Line: 764]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 73 with TraceHistMax 5,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 2ms.. - TimeoutResultAtElement [Line: 763]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 73 with TraceHistMax 5,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 2ms.. - TimeoutResultAtElement [Line: 714]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 73 with TraceHistMax 5,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 2ms.. - TimeoutResultAtElement [Line: 731]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 73 with TraceHistMax 5,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 2ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 212 locations, 8 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.2s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 870.4s, OverallIterations: 12, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 91.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1291 SdHoareTripleChecker+Valid, 24.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1291 mSDsluCounter, 86 SdHoareTripleChecker+Invalid, 23.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 70 mSDsCounter, 127 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2970 IncrementalHoareTripleChecker+Invalid, 3097 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 127 mSolverCounterUnsat, 16 mSDtfsCounter, 2970 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 256 GetRequests, 160 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1093 ImplicationChecksByTransitivity, 65.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14350occurred in iteration=11, InterpolantAutomatonStates: 94, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 9302 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 10.6s InterpolantComputationTime, 166 NumberOfCodeBlocks, 166 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 214 ConstructedInterpolants, 1 QuantifiedInterpolants, 3849 SizeOfPredicates, 43 NumberOfNonLiveVariables, 1896 ConjunctsInSsa, 130 ConjunctsInUnsatCore, 13 InterpolantComputations, 9 PerfectInterpolantSequences, 7/47 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 could not prove your program: Timeout Completed graceful shutdown